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

DOI10.2298/AADM0802255FMaRDI QIDQ3643775zbMATH OpenFDO

Authors Guihai Yu, Zheng-Tao Jiang, Ling-Zhi Ren, Lihua Feng

Publication date 9 November 2009

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

Full work available at URL https://doi.org/10.2298/AADM0802255F

zbMATH Keywords

adjacency matrixcomplexityLaplacian eigenvaluesnumber of spanning trees

Mathematics Subject Classification ID

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

Recommendations

• A sharp upper bound for the number of spanning trees of a graph
• On the \(k\)th largest eigenvalue of the Laplacian matrix of a graph
• scientific article; zbMATH DE number 1161331
• A bound for the complexity of a simple graph
• The number of spanning trees of a graph

Cited in

(17)

• Expected distance based on random walks
• The maximum number of spanning trees of a graph with given matching number
• A sharp upper bound for the number of spanning trees of a graph
• Upper bounds on number of steals in rooted trees
• On the upper bound for the number of spanning trees of a connected graph
• The dynamics of the forest graph operator
• Upper bounds for the number of spanning trees of graphs
• scientific article; zbMATH DE number 1161331 (Why is no real title available?)
• On the VC-dimension‎, ‎covering and separating properties of the cycle and spanning tree hypergraphs of graphs
• scientific article; zbMATH DE number 5174860 (Why is no real title available?)
• Sharp upper and lower bounds on the number of spanning trees in Cartesian product of graphs
• The number of spanning trees of a graph with given matching number
• The number of spanning trees of a graph
• The number of spanning trees of a graph
• Spanning tree bounds for grid graphs
• Spanning trees: A survey
• Laplacian coefficients, Kirchhoff index and the number of spanning trees of graphs

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

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