Kirchhoff's theorem 2026-10-14
View more
The matrix-tree theorem expresses the weighted number of spanning trees of a finite graph as a cofactor of its Graph Laplacian. For a directed graph with out-Laplacian , deleting the row and column indexed by a root gives
(1)
where the sum runs over directed spanning trees rooted towards .
Read the full article