1.Previous
3.Next

as the given graph (i.e., a maximal forest), while instead call this kind of forest a "maximal spanning forest" (which is redundant, as a maximal forest necessarily contains every vertex).

Counting spanning trees

The number t(G) of spanning trees of a connected graph is a well-studied invariant.

In specific graphs

In some cases, it is easy to calculate t(G) directly:
* If G is itself a tree, then .
* When G is the cycle graph

1.Previous
3.Next