Assertion: tree | /r/HasProperty | undirected graph
Facets:
value: in mathematics
type: OTHER
value: in graph theory
type: OTHER
Source sentences:
text: In graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one path, or equivalently a connected acyclic undirected graph.
text: A tree is an undirected graph G that satisfies any of the following equivalent conditions:
text: In mathematics, a tree is an undirected graph in which any two vertices are connected by exactly one simple path.