Assertion: spanning tree | /r/HasAspect | v − 1 edges
Facets:
Source sentences:
text: For a connected graph with V vertices, any spanning tree will have V − 1 edges, and thus, a graph of E edges and one of its spanning trees will have E − V + 1 fundamental cycles.