Critical groups of graphs with dihedral actions

DOI10.1016/j.ejc.2013.12.005zbMath1284.05124arXiv1304.6011MaRDI QIDQ2441951

Darren Glass, Criel Merino

Publication date: 31 March 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

dihedral group; harmonic actions; finite connected graphs

Mathematics Subject Classification ID

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

05C40: Connectivity

Related Items

Klein Four Actions on Graphs and Sets, Chip-Firing Games and Critical Groups, Critical groups of graphs with dihedral actions. II., The sandpile group of polygon rings and twisted polygon rings, The sandpile group of a polygon flower, Maximal harmonic group actions on finite graphs

Cites Work

• An efficient approach for counting the number of spanning trees in circulant and related graphs
• Enumerating spanning trees of graphs with an involution
• Idempotent relations and factors of Jacobians
• Chip-firing and the critical group of a graph
• Chip-firing games, potential theory on graphs, and spanning trees
• Riemann-Roch and Abel-Jacobi theory on a finite graph
• Enumeration of spanning trees of graphs with rotational symmetry
• The number of spanning trees of plane graphs with reflective symmetry
• Primer for the algebraic geometry of sandpiles
• Genus Bounds for Harmonic Group Actions on Finite Graphs
• Harmonic Morphisms and Hyperelliptic Graphs
• Counting Trees in a Certain Class of Graphs
• Graph-Theoretic Concepts in Computer Science