Sharp upper bounds for the number of spanning trees of a graph

DOI10.2298/AADM0802255FzbMath1195.05018MaRDI QIDQ3643775

Ling-Zhi Ren, Guihai Yu, Zheng-Tao Jiang, Li-Hua Feng

Publication date: 9 November 2009

Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

complexityadjacency matrixLaplacian eigenvaluesnumber of spanning trees

Mathematics Subject Classification ID

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

Related Items (9)

The dynamics of the forest graph operator ⋮ Upper bounds for the number of spanning trees of graphs ⋮ Spanning tree bounds for grid graphs ⋮ Expected distance based on random walks ⋮ Spanning trees: A survey ⋮ The number of spanning trees of a graph ⋮ The maximum number of spanning trees of a graph with given matching number ⋮ On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs ⋮ The number of spanning trees of a graph with given matching number

This page was built for publication: Sharp upper bounds for the number of spanning trees of a graph