On polynomials of spanning trees

DOI10.1007/PL00001273zbMATH Open0947.05050OpenAlexW2074738047MaRDI QIDQ1977729FDOQ1977729

Chao Yang, Fan 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 treematrix-tree theoremcombinatorial Laplacianprobabilistic Kirchhoff polynomial

Mathematics Subject Classification ID

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

Cited In (12)

• Transformations of a graph increasing its Laplacian polynomial and number of spanning trees
• Spanning tree generating functions and Mahler measures
• The Grassmann-Berezin calculus and theorems of the matrix-tree type
• The tree graph identity and the polymer expansion
• Matroids, motives, and a conjecture of Kontsevich.
• The enumeration of spanning tree of weighted graphs
• Disposition polynomials and plane trees
• Counting spanning trees of \((1, N\))-periodic graphs
• Structure Polynomials and Subgraphs of Rooted Regular Trees
• The spectrum and spanning trees of polyominos on the torus
• Flow polynomials as Feynman amplitudes and their \(\alpha\)-representation
• A \(K3\) in \(\phi^{4}\)

This page was built for publication: On polynomials of spanning trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1977729)