Forest is a disjoint union of trees, an undirected, acyclic graph. Tree is a labeled, rooted tree, consists of a central vertex. G is a acyclic, simple cycle, has many vertices say n, no simple cycles has edges. Problem is to count spanning trees in an undirected graph. Trees Counting the number of unlabeled, free trees.

Labeled, rooted tree, Tree, Tree, Tree