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

DOI10.1016/J.LAA.2017.04.032zbMATH Open1365.05135arXiv1612.03372OpenAlexW2563773140MaRDI QIDQ2361566FDOQ2361566

Young Soo Kwon, I. A. Mednykh, Alexander Mednykh

Publication date: 30 June 2017

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

Abstract: In the present paper we find a simple algorithm for counting Jacobian group of the generalized Petersen graph GP(n,k). Also, we obtain a closed formula for the number of spanning trees of this graph in terms of Chebyshev polynomials.

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

zbMATH Keywords

Laplacian matrixChebyshev polynomialPetersen graphspanning treeJacobian group

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Chip-firing and the critical group of a graph
• On the sandpile group of dual graphs
• Algebraic aspects of Abelian sandpile models
• Smith normal form and Laplacians
• Harmonic Morphisms and Hyperelliptic Graphs
• The lattice of integral flows and the lattice of integral cuts on a finite graph
• Spanning tree formulas and Chebyshev polynomials
• Spanning trees on graphs and lattices inddimensions
• Spanning trees on the Sierpinski gasket
• COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
• The number of spanning trees in \(K_ n\)-complements of quasi-threshold 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
• On the structure of the Jacobian group for circulant graphs
• On the sandpile group of the square cycle \(C^{2}_{n}\)
• On the structure of Picard group for Moebius ladder
• The isomorphism classes of the generalized Petersen graphs
• Sandpile group on the graph \(\mathcal D_n\) of the dihedral group
• Weighted spanning trees on some self-similar graphs
• The critical group of \(K_{m} \times C_{n}\)
• On the Jacobian Group for Möbius Ladder and Prism Graphs

Cited In (15)

• Determining the edge metric dimension of the generalized Petersen graph \(P(n, 3)\)
• Plans' periodicity theorem for Jacobian of circulant graphs
• Complexity of the circulant foliation over a graph
• Complexity of discrete Seifert foliations over a graph
• Counting spanning trees in cobordism of two circulant graphs
• On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials
• Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians
• The number of rooted forests in circulant graphs
• Counting rooted spanning forests in cobordism of two circulant graphs
• Counting rooted spanning forests for circulant foliation over a graph
• Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics
• On the structure of the critical group of a circulant graph with non-constant jumps
• Spanning trees in \(\mathbb{Z} \)-covers of a finite graph and Mahler measures
• The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
• Iwasawa theory of Jacobians of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2361566)