The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic

DOI10.1016/j.disc.2018.08.030zbMath1414.05080arXiv1711.00175OpenAlexW2963854080MaRDI QIDQ1999743

Ilya A. Mednykh, Alexander Mednykh

Publication date: 27 June 2019

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

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

zbMATH Keywords

Mahler measurespanning treeLaplacian matrixChebyshev polynomialcirculant graph

Mathematics Subject Classification ID

Trees (05C05)

Related Items (11)

The number of rooted forests in circulant graphs ⋮ Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics ⋮ Generalised voltage graphs ⋮ On abelian \(\ell \)-towers of multigraphs. II ⋮ Counting rooted spanning forests for circulant foliation over a graph ⋮ Counting spanning trees of \((1, N\))-periodic graphs ⋮ Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians ⋮ Chip-Firing Games and Critical Groups ⋮ Finite cubic graphs admitting a cyclic group of automorphism with at most three orbits on vertices ⋮ Unnamed Item ⋮ Complexity of the circulant foliation over a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the structure of the Jacobian group for circulant graphs
• Asymptotics and arithmetical properties of complexity for circulant graphs
• Asymptotics for the number of spanning trees in circulant graphs and degenerating \(d\)-dimensional discrete tori
• Smith normal form and Laplacians
• The asymptotic number of spanning trees in circulant graphs
• Spanning tree formulas and Chebyshev polynomials
• 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
• The number of spanning trees in odd valent circulant graphs
• Factorization of certain cyclotomic functions
• On embeddings of circulant graphs
• On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs
• The Enumeration of Point Labelled Chromatic Graphs and Trees
• On Some Inequalities for Polynomials in Several Variables
• A solution of the isomorphism problem for circulant graphs
• Spanning trees on graphs and lattices inddimensions
• On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials
• The number of spanning trees in a prism
• Spanning tree generating functions and Mahler measures
• COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
• Dimer problem in statistical mechanics-an exact result
• On the number of spanning trees of finite graphs
• Asymptotic Enumeration of Spanning Trees

This page was built for publication: The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic