An elementary proof of a matrix tree theorem for directed graphs

2019/04/27 by De Leenheer, Patrick · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1904.12221

Abstract

We present an elementary proof of a generalization of Kirchoff's matrix tree theorem to directed, weighted graphs. The proof is based on a specific factorization of the Laplacian matrices associated to the graphs, which only involves the two incidence matrices that capture the graph's topology. We also point out how this result can be used to calculate principal eigenvectors of the Laplacian matrices.

Cited by

• Combinatorial Identities Using the Matrix Tree Theorem

Related

• Matrix tree theorem for the net Laplacian matrix of a signed graph
• Abstract matrix-tree theorem
• A Beginner's Guide to Counting Spanning Trees in a Graph
• Matrix-Forest Theorems
• Higher determinants and the matrix-tree theorem