Assertion: graph's vertex | /r/CapableOf | connect corresponding vertices
Facets:
value: in g. all of these graphs
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.