2013/10/13 by I. A. Krepkiy, Krepkiy, I. A.
Engineering · #Advanced Theoretical and Applied Studies in Material Sciences and Geometry #Combinatorics (math.CO) #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.1310.3490
openalex publication_date 2013/10/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The article considers the procedure of connection of graphs to the edges of a cyclic graph and its influence on the sandpile group of the graph thus obtained. A series of classes of graphs CHn(a1,...,an) is defined. Recurrent and non-recurrent formulas for calculating the sandpile groups of all graphs of classes CHn (a1, ..., an) are proposed.