On polynomials of spanning trees

DOI10.1007/PL00001273zbMath0947.05050OpenAlexW2074738047MaRDI QIDQ1977729

Chao Yang, Fan R. K. Chung

Publication date: 5 November 2000

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00001273

zbMATH Keywords

spanning treecombinatorial Laplacianmatrix-tree theoremprobabilistic Kirchhoff polynomial

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Matroids, motives, and a conjecture of Kontsevich., The Grassmann-Berezin calculus and theorems of the matrix-tree type, Counting spanning trees of \((1, N\))-periodic graphs, A \(K3\) in \(\phi^{4}\), Flow polynomials as Feynman amplitudes and their \(\alpha\)-representation, The enumeration of spanning tree of weighted graphs