The number of spanning trees in regular graphs

DOI10.1002/RSA.3240010204zbMATH Open0820.05033OpenAlexW2135465119MaRDI QIDQ3977073FDOQ3977073

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

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

zbMATH Keywords

regular graphsnumber of spanning trees

Mathematics Subject Classification ID

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

Cites Work

• Spanning trees in regular graphs
• Algebraic Graph Theory
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (21)

• Spanning trees in random series-parallel graphs
• On the number of spanning trees in random regular graphs
• The number of spanning trees of the regular networks
• The average number of spanning trees in sparse graphs with given degrees
• Volume Bounds for the Phase-Locking Region in the Kuramoto Model with Asymmetric Coupling
• The enumeration of spanning tree of weighted graphs
• The local limit of the uniform spanning tree on dense graphs
• Bounding the number of bases of a matroid
• The number of bounded‐degree spanning trees
• Log-concave poset inequalities
• Upper bound for the number of spanning forests of regular graphs
• Lehmer's question, graph complexity growth and links
• The number of spanning trees in graphs with a given degree sequence
• Counting trees in directed regular multigraphs
• Title not available (Why is that?)
• On the tree number of regular graphs
• The number of spanning trees in 4-regular simple graphs
• Title not available (Why is that?)
• Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph
• The minimum number of spanning trees in regular multigraphs
• The number of spanning trees of the Cartesian product of regular graphs

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)