Abstract
Tutte’s Matrix-Tree Theorem gives the number of spanning trees in a connected digraph by the determinant of a submatrix of the Laplacian, which is a generalization of the original Kirchhoff’s Matrix-Tree Theorem associated to undirected graphs. In this paper, we obtain a new extension of Tutte’s Matrix-Tree Theorem in terms of the signless Laplaicians. Moreover, we provide an elementary proof in terms of the factorization of signless Laplacian matrix into two incidence matrices. We finally generalize our result to the directed weighted graphs.
Publication
In Linear Algebra and Its Applications
Click the Cite button above to demo the feature to enable visitors to import publication metadata into their reference management software.
Create your slides in Markdown - click the Slides button to check out the example.
Supplementary notes can be added here, including code, math, and images.
Lu Lu(鲁卢)
Associate Professor, PhD Supervisor
My research interests include algebraic graph theory, spectral graph theory and group theory.