An Elementary Proof of a Matrix Tree Theorem for Directed Graphs
SIAM REVIEW(2020)
摘要
We present an elementary proof of a generalization of Kirchhoff'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 involves only 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.
更多查看译文
关键词
directed graphs,spanning trees,matrix tree theorem
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要