Difference between revisions of "Tree (graph theory)"
(Created page with "a tree is a branch with leaves")
|(One intermediate revision by the same user not shown)|
|Line 1:||Line 1:|
a tree is a
a tree is a with
Latest revision as of 16:51, 2 November 2020
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.