Assertion: graph's edge | /r/CapableOf | connect two vertices
Facets:
value: in s
type: LOCATION
Source sentences:
text: All the edges and vertices of G might not be present in S; but if a vertex is present in S, it has a corresponding vertex in G and any edge that connects two vertices in S will also connect the corresponding vertices in G. All of these graphs are subgraphs of the first graph.
text: While an edge connecting two vertices u and v is usually interpreted as the set { u, v }, an edge is sometimes interpreted as the line segment connecting u and v so that the resulting structure is a CW complex.
text: When an edge connects two vertices, we say that the vertices are adjacent to one another and that the edge is incident on both vertices.