The number of spanning trees in regular graphs

DOI10.1002/RSA.3240010204MaRDI QIDQ3977073zbMATHOpenAlexFDO

Authors Noga Alon

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

zbMATH Keywords

regular graphsnumber of spanning trees

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Recommendations

• The number of spanning trees in graphs with a given degree sequence
• The asymptotic number of spanning trees in circulant graphs (extended abstract)
• On the number of spanning trees in random regular graphs
• The number of bounded‐degree spanning trees
• Upper bound for the number of spanning forests of regular graphs

Cites work

• scientific article; zbMATH DE number 3482343 (Why is no real title available?)
• scientific article; zbMATH DE number 3311772 (Why is no real title available?)
• Algebraic Graph Theory
• Spanning trees in regular graphs

Cited in

(21)

• The local limit of the uniform spanning tree on dense graphs
• The number of spanning trees in 4-regular simple graphs
• The number of spanning trees in graphs with a given degree sequence
• Lehmer's question, graph complexity growth and links
• scientific article; zbMATH DE number 5584928 (Why is no real title available?)
• The average number of spanning trees in sparse graphs with given degrees
• Counting trees in directed regular multigraphs
• Bounding the number of bases of a matroid
• scientific article; zbMATH DE number 5497806 (Why is no real title available?)
• The enumeration of spanning tree of weighted graphs
• On the tree number of regular graphs
• The minimum number of spanning trees in regular multigraphs
• The number of spanning trees of the Cartesian product of regular graphs
• Spanning trees in random series-parallel graphs
• The number of bounded‐degree spanning trees
• Log-concave poset inequalities
• On the number of spanning trees in random regular graphs
• The number of spanning trees of the regular networks
• Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph
• Upper bound for the number of spanning forests of regular graphs
• Volume bounds for the phase-locking region in the Kuramoto model with asymmetric coupling

This page was built for publication: The number of spanning trees in regular graphs

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