Upper bounds for the number of spanning trees of graphs

DOI10.1186/1029-242X-2012-269zbMath1277.05040OpenAlexW2098775683WikidataQ59271915 ScholiaQ59271915MaRDI QIDQ387931

Mohammad Hasan, H. S. Yoon

Publication date: 17 December 2013

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/1029-242x-2012-269

zbMATH Keywords

graphspanning treesnormalized Laplacian eigenvalues

Mathematics Subject Classification ID

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

Related Items (3)

An Improved Lower Bound for the Degree Kirchhoff Index of Bipartite Graphs ⋮ The maximum number of spanning trees of a graph with given matching number ⋮ The number of spanning trees of a graph with given matching number

Cites Work

• Bounds on Randić indices
• A bound for the complexity of a simple graph
• An upper bound for the number of spanning trees of a graph
• A sharp upper bound for the number of spanning trees of a graph
• Sharp upper bounds for the number of spanning trees of a graph
• Determinants with Elements ± 1
• The number of spanning trees of a graph

This page was built for publication: Upper bounds for the number of spanning trees of graphs