On the critical group of hinge graphs

arXiv2210.01793MaRDI QIDQ6412906FDOQ6412906

Authors: Aren Martinian, Andrés R. Vindas Meléndez 

Publication date: 4 October 2022

Abstract: Let $G$ be a finite, connected, simple graph. The critical group $K(G)$, or equivalently the sandpile group, is the torsion group constructed by taking the cokernel of the graph Laplacian $operatornamecok(L)$. We investigate a family of graphs with relatively simple non-cyclic critical group with an end goal of understanding whether multiple divisors, i.e., formal linear combinations of vertices of $G$, generate $K(G)$. These graphs, referred to as hinge graphs, can be intuitively understood by taking multiple base shapes and "gluing" them together by a single shared edge and two corresponding shared vertices. In the case where all base shapes are identical, we prove the explicit structure of the critical group. Additionally, we prove the order of three special divisors. Towards proving the structure of the critical group of hinge graphs when variance in the number of vertices of each base shape is allowed, we generalize many of the aforementioned results.

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

This page was built for publication: On the critical group of hinge graphs

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