The Sandpile Group of a Thick Cycle Graph
Authors:
Preprint
Abstract
The majority of graphs whose sandpile groups are known are either regular or simple. We give an explicit formula for a family of non-regular multi-graphs called thick cycles. A thick cycle graph is a cycle where multi-edges are permitted. Its sandpile group is the direct sum of cyclic groups of orders given by quotients of greatest common divisors of minors of its Laplacian matrix. We show these greatest common divisors can be expressed in terms of monomials in the graph's edge multiplicities.Keywords
All Related Versions
This publication has 25 references indexed in Scilit:
- Realization of Groups with Pairing as Jacobians of Finite GraphsAnnals of Combinatorics, 2018
- The Critical Group of a Line GraphAnnals of Combinatorics, 2012
- The critical group of K m × C nActa Mathematica Sinica, English Series, 2010
- The critical groups of a family of graphs and elliptic curves over finite fieldsJournal of Algebraic Combinatorics, 2008
- Riemann–Roch and Abel–Jacobi theory on a finite graphAdvances in Mathematics, 2007
- Critical groups for complete multipartite graphs and Cartesian products of complete graphsJournal of Graph Theory, 2003
- On the Sandpile Group of Dual GraphsEuropean Journal of Combinatorics, 2000
- Unimodular equivalence of graphsLinear Algebra and its Applications, 1992
- A finite group attached to the laplacian of a graphDiscrete Mathematics, 1991
- Arithmetical graphsMathematische Annalen, 1989