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 .

Ancestors (6)

  1. Spanning tree
  2. Tree
  3. Combinatorics
  4. Area of mathematics
  5. Mathematics
  6. Home

Incoming links (2)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version