Assertion: graph's edge | /r/CapableOf | join two vertices
Facets:
value: in a hypergraph
type: OTHER
Source sentences:
text: A Euclidean graph is a pair (V, E), where V is a set of points (sometimes called vertices or nodes) and E is a set of edges (sometimes called bonds), where each edge joins two vertices.
text: Similarly, two vertices are called adjacent if they share a common edge (consecutive if the first one is the tail and the second one is the head of an edge), in which case the common edge is said to join the two vertices.
text: First construct a subgraph of G by deleting the dashed edges (and the resulting isolated vertex), and then contract the gray edge (merging the two vertices it connects):
text: In a hypergraph, an edge can join more than two vertices.
text: A graph consists of a set of nodes or vertices together with a set of edges or arcs where each edge joins two vertices.