Assertion: tree | /r/HasProperty | connected graph
Facets:
value: with no finite cycles
type: OTHER
value: as with finite graphs
type: OTHER
Source sentences:
text: As with finite graphs, a tree is a connected graph with no finite cycles, and a spanning tree can be defined either as a maximal acyclic set of edges or as a tree that contains every vertex.