Pages that link to "Item:Q387931"
From MaRDI portal
The following pages link to Upper bounds for the number of spanning trees of graphs (Q387931):
Displaying 8 items.
- Upper bounds on number of steals in rooted trees (Q255260) (← links)
- Bounds on the number of edges in hypertrees (Q279202) (← links)
- An upper bound for the Garcia-Stichtenoth numbers of towers (Q819515) (← links)
- Bounds of the number of leaves of spanning trees in graphs without triangles (Q1930213) (← links)
- The maximum number of spanning trees of a graph with given matching number (Q2239004) (← links)
- A lower bound on the number of spanning trees withk end-vertices (Q3801584) (← links)
- An Improved Lower Bound for the Degree Kirchhoff Index of Bipartite Graphs (Q5051424) (← links)
- The number of spanning trees of a graph with given matching number (Q5739584) (← links)