Assertion: graph's g | /r/HasProperty | n-vertex graph
Facets:
Source sentences:
text: If G is any n-vertex graph, then the rooted product of G with a one-edge graph (that is, the graph H formed by adding n new vertices to G, each of degree one and each adjacent to a distinct vertex in G) is well-covered.