On the Jacobian group of a cone over a circulant graph

DOI10.25587/svfu.2021.32.84.006OpenAlexW3202246982MaRDI QIDQ6117337

Ilya A. Mednykh, Liliya Aleksandrovna Grunwald

Publication date: 20 March 2024

Published in: Журнал «Математические заметки СВФУ» (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.25587/svfu.2021.32.84.006

zbMATH Keywords

spanning treeLaplacian matrixChebyshev polynomialcirculant graphspanning forestcone over graph

Mathematics Subject Classification ID

Computer science (68-XX) Combinatorics (05-XX)

Related Items

Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the structure of the Jacobian group for circulant graphs
• On the sandpile group of the cone of a graph
• On the sandpile group of the square cycle \(C^{2}_{n}\)
• On the structure of Picard group for Moebius ladder
• Smith normal form and Laplacians
• Spanning tree formulas and Chebyshev polynomials
• Chip-firing and the critical group of a graph
• A certain polynomial of a graph and graphs with an extremal number of trees
• On the sandpile group of dual graphs
• Counting spanning trees in cobordism of two circulant graphs
• Critical groups of iterated cones
• The number of trees in a graph. I. II
• On the Number of Distinct Forests
• Harmonic Morphisms and Hyperelliptic Graphs
• Enumeration of Forests in a Graph
• The lattice of integral flows and the lattice of integral cuts on a finite graph
• 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
• Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition
• COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
• On the number of spanning trees of finite graphs