Complexity of the circulant foliation over a graph

DOI10.1007/s10801-019-00921-7zbMath1464.05194arXiv1902.05681OpenAlexW3009018281MaRDI QIDQ2025146

Young Soo Kwon, Alexander Mednykh, Ilya A. Mednykh

Publication date: 11 May 2021

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Chebyshev polynomialscirculant graphsspanning treesLaplacian matricesPetersen graphs\(I\)-graphs

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Additive difference equations (39A10) Structural characterization of families of graphs (05C75)

Related Items (2)

Counting rooted spanning forests for circulant foliation over a graph ⋮ Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weighted spanning trees on some self-similar graphs
• Asymptotics and arithmetical properties of complexity for circulant graphs
• Spanning trees on the Sierpinski gasket
• Smith normal form and Laplacians
• The asymptotic number of spanning trees in circulant graphs
• The isomorphism classes of the generalized Petersen graphs
• Spanning tree formulas and Chebyshev polynomials
• Symmetric Y-graphs and H-graphs
• Heights of polynomials and entropy in algebraic dynamics
• Counting spanning trees in cobordism of two circulant graphs
• The number of spanning trees in odd valent circulant graphs
• Polynomials. Translated from the second Russian edition by Dimitry Leites.
• The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
• 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
• A FORMULA FOR THE NUMBER OF SPANNING TREES IN CIRCULANT GRAPHS WITH NONFIXED GENERATORS AND DISCRETE TORI
• Spanning trees on graphs and lattices inddimensions
• On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials
• Spanning tree generating functions and Mahler measures
• COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
• Three Remarkable Graphs

This page was built for publication: Complexity of the circulant foliation over a graph