The number of spanning forests of a graph

DOI10.1016/j.disc.2004.10.014zbMath1058.05040MaRDI QIDQ1772421

Yasuo Teranishi

Publication date: 18 April 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.10.014

zbMATH Keywords

Graph Laplacian; Forest; Graph spectrum

Mathematics Subject Classification ID

05C30: Enumeration in graph theory

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

Related Items

The number of spanning trees of a graph with given matching number, The dynamics of the forest graph operator, Cover-encodings of fitness landscapes, The maximum number of spanning trees of a graph with given matching number, Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth

Cites Work

• Unnamed Item
• Transportation in graphs and the admittance spectrum
• Eigenvalues, diameter, and mean distance in graphs
• An upper bound for the number of spanning trees of a graph
• The Hoffman number of a graph
• Zeta functions of finite graphs and coverings
• On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
• ON ZETA AND L-FUNCTIONS OF FINITE GRAPHS
• The Laplacian Spectrum of a Graph II
• THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
• Characteristic vertices of trees^*
• A new 5‐arc‐transitive cubic graph