Tree (graph theory)
A tree is an undirected graph which is both connected and acyclic. Equivalently, a tree is a graph such that for any two vertices
with
, there is exactly one path connecting
and
in
. Every tree that has
vertices has exactly
edges.
The converse is also true: an undirected and connected graph with vertices and
edges is a tree.
This article is a stub. Help us out by expanding it.