Upper bounds for the number of spanning trees of graphs
From MaRDI portal
Publication:387931
DOI10.1186/1029-242X-2012-269zbMath1277.05040WikidataQ59271915 ScholiaQ59271915MaRDI QIDQ387931
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
Related Items
An Improved Lower Bound for the Degree Kirchhoff Index of Bipartite Graphs, The number of spanning trees of a graph with given matching number, The maximum 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