Tree (graph theory)
Revision as of 15:51, 2 November 2020 by Scrabbler94 (talk | contribs)
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 on 
vertices has exactly 
edges.
