◀ ▲ ▶Branches / Graphtheory / Theorem: Number of Labeled Spanning Trees
Theorem: Number of Labeled Spanning Trees
In a complete graph \(K_n\) with \(n\ge 2\) labeled vertices, the number of different spanning trees is \(n^{n2}\).
This theorem was discovered by Arthur Cayley (1821  1895).
Table of Contents
Proofs: 1
Thank you to the contributors under CC BYSA 4.0!
 Github:

References
Bibliography
 Krumke S. O., Noltemeier H.: "Graphentheoretische Konzepte und Algorithmen", Teubner, 2005, 1st Edition