A FORMULA FOR THE NUMBER OF SPANNING TREES IN CIRCULANT GRAPHS WITH NONFIXED GENERATORS AND DISCRETE TORI

DOI10.1017/S0004972715000969zbMath1328.05047arXiv1312.4389OpenAlexW2112743730MaRDI QIDQ3458375

Justine Louis

Publication date: 18 December 2015

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.4389

zbMATH Keywords

circulant graphsspanning treesspanning tree entropy

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 ⋮ An explicit prime geodesic theorem for discrete tori and the hypergeometric functions ⋮ Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians ⋮ Spanning trees in directed circulant graphs and cycle power graphs ⋮ Complexity of the circulant foliation over a graph ⋮ Asymptotic analysis of determinant of discrete Laplacian ⋮ Complexity of discrete Seifert foliations over a graph ⋮ Asymptotics for the determinant of the combinatorial Laplacian on hypercubic lattices

Cites Work

• Unnamed Item
• The asymptotic number of spanning trees in circulant graphs
• Spanning tree formulas and Chebyshev polynomials
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs
• Asymptotic Enumeration of Spanning Trees