Assertion: graph's edge | /r/CapableOf | join vertex
Facets:
value: to it
type: TRANSITIVE-OBJECT
value: in $
type: OTHER
Source sentences:
text: If the vertex-set of a graph G can be split into two disjoint sets, $V_1$ and $V_2$, in such a way that each edge in the graph joins a vertex in $V_1$ to a vertex in $V_2$, and there are no edges in G that connect two vertices in $V_1$ or two vertices in $V_2$, then the graph $G$ is called a bipartite graph.
text: A loop is an edge whose endpoints are equal i.e., an edge joining a vertex to it self is called a loop.
text: A bipartite graph is a graph whose vertex-set can be split into two sets in such a way that each edge of the graph joins a vertex in first set to a vertex in second set.