The number of spanning trees in regular graphs
From MaRDI portal
Publication:3977073
DOI10.1002/rsa.3240010204zbMath0820.05033OpenAlexW2135465119MaRDI QIDQ3977073
Publication date: 25 June 1992
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240010204
Related Items (11)
The local limit of the uniform spanning tree on dense graphs ⋮ The number of bounded‐degree spanning trees ⋮ Bounding the number of bases of a matroid ⋮ The number of spanning trees in graphs with a given degree sequence ⋮ The enumeration of spanning tree of weighted graphs ⋮ Lehmer's question, graph complexity growth and links ⋮ Volume Bounds for the Phase-Locking Region in the Kuramoto Model with Asymmetric Coupling ⋮ Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph ⋮ The minimum number of spanning trees in regular multigraphs ⋮ Spanning trees in random series-parallel graphs ⋮ The average number of spanning trees in sparse graphs with given degrees
Cites Work
This page was built for publication: The number of spanning trees in regular graphs
