The asymptotic number of spanning trees in circulant graphs

DOI10.1016/j.disc.2009.09.008zbMath1205.05108OpenAlexW2143623416MaRDI QIDQ965958

Mordecai J. Golin, Yuanping Zhang, Xue-rong Yong

Publication date: 27 April 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.09.008

zbMATH Keywords

gridscirculant graphstorispanning trees

Mathematics Subject Classification ID

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

Related Items

Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics ⋮ A FORMULA FOR THE NUMBER OF SPANNING TREES IN CIRCULANT GRAPHS WITH NONFIXED GENERATORS AND DISCRETE TORI ⋮ On the number of spanning trees in random regular graphs ⋮ Asymptotics for the number of spanning trees in circulant graphs and degenerating \(d\)-dimensional discrete tori ⋮ Counting rooted spanning forests for circulant foliation over a graph ⋮ On two conjectures concerning spanning tree edge dependences of graphs ⋮ Spanning trees in directed circulant graphs and cycle power graphs ⋮ The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic ⋮ Complexity of the circulant foliation over a graph ⋮ Complexity of discrete Seifert foliations over a graph ⋮ The formulas for the number of spanning trees in circulant graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of spanning trees in directed circulant graphs with non-fixed jumps
• Spanning tree formulas and Chebyshev polynomials
• Tree counting polynomials for labelled graphs. I: Properties
• Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
• The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)
• The number of spanning trees in circulant graphs
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs
• On the number of spanning trees in directed circulant graphs
• On the asymptotic behavior of the maximum number of spanning trees in circulant graphs
• Asymptotic Enumeration of Spanning Trees
• Algorithms and Computation

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