Asymptotics and arithmetical properties of complexity for circulant graphs

DOI10.1134/S1064562418020138zbMath1391.05150OpenAlexW2803126585WikidataQ129782527 ScholiaQ129782527MaRDI QIDQ721814

Ilya A. Mednykh, Alexander Mednykh

Publication date: 20 July 2018

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

Full work available at URL: https://doi.org/10.1134/s1064562418020138

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40)

Related Items (8)

Counting spanning trees in cobordism of two circulant graphs ⋮ Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics ⋮ Counting rooted spanning forests for circulant foliation over a graph ⋮ Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians ⋮ The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic ⋮ Complexity of the circulant foliation over a graph ⋮ Counting rooted spanning forests in cobordism of two circulant graphs ⋮ Complexity of discrete Seifert foliations over a graph

Cites Work

• On the sandpile group of the square cycle \(C^{2}_{n}\)
• Asymptotics for the number of spanning trees in circulant graphs and degenerating \(d\)-dimensional discrete tori
• Smith normal form and Laplacians
• Spanning tree formulas and Chebyshev polynomials
• Heights of polynomials and entropy in algebraic dynamics
• The number of spanning trees in circulant graphs
• The number of spanning trees in odd valent circulant graphs
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs
• Spanning trees on graphs and lattices inddimensions
• Spanning tree generating functions and Mahler measures

This page was built for publication: Asymptotics and arithmetical properties of complexity for circulant graphs