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 giveswhere the sum runs over directed spanning trees rooted towards .
New to topics? Read the docs here!