On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials

DOI10.1016/j.laa.2017.04.032zbMath1365.05135arXiv1612.03372OpenAlexW2563773140MaRDI QIDQ2361566

Young Soo Kwon, Ilya A. Mednykh, Alexander Mednykh

Publication date: 30 June 2017

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

spanning treeLaplacian matrixChebyshev polynomialPetersen graphJacobian group

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Additive difference equations (39A10)

Related Items (14)

Counting spanning trees in cobordism of two circulant graphs ⋮ Determining the edge metric dimension of the generalized Petersen graph \(P(n, 3)\) ⋮ The number of rooted forests in 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 ⋮ On the structure of the critical group of a circulant graph with non-constant jumps ⋮ Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians ⋮ On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials ⋮ Plans' periodicity theorem for Jacobian of circulant graphs ⋮ 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 ⋮ Iwasawa theory of Jacobians of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the structure of the Jacobian group for circulant graphs
• The critical group of \(K_{m} \times C_{n}\)
• Weighted spanning trees on some self-similar graphs
• The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
• On the sandpile group of the square cycle \(C^{2}_{n}\)
• Spanning trees on the Sierpinski gasket
• On the structure of Picard group for Moebius ladder
• Smith normal form and Laplacians
• The isomorphism classes of the generalized Petersen graphs
• Spanning tree formulas and Chebyshev polynomials
• Chip-firing and the critical group of a graph
• Sandpile group on the graph \(\mathcal D_n\) of the dihedral group
• On the sandpile group of dual graphs
• The number of spanning trees in circulant graphs
• The number of spanning trees in odd valent circulant graphs
• Jacobian tori associated with a finite graph and its abelian covering graphs
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs
• Harmonic Morphisms and Hyperelliptic Graphs
• The lattice of integral flows and the lattice of integral cuts on a finite graph
• Spanning trees on graphs and lattices inddimensions
• Algebraic aspects of Abelian sandpile models
• On the Jacobian Group for Möbius Ladder and Prism Graphs
• COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS

This page was built for publication: On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials