论文信息 - The sandpile group of a bilateral regular tree

The sandpile group of a bilateral regular tree

Let Tn be a (d − 1)-ary tree of height n. A bilateral regular tree is the multigraph T d n,n that is defined by : (i) juxtaposing two Tn’s, (ii) drawing a new edge between two roots and (iii) drawing d− 1 edges between each leaf and a new vertex, called the sink. In this paper the sandpile group of T d n,n is determined.

Yaoping Hou | Xiaoling Shen

[1] Dino J. Lorenzini. Arithmetical graphs , 1989 .

[2] Tang,et al. Self-Organized Criticality: An Explanation of 1/f Noise , 2011 .

[3] D. Dhar,et al. Algebraic aspects of Abelian sandpile models , 1995 .

[5] Robert Cori,et al. On the Sandpile Group of Dual Graphs , 2000, Eur. J. Comb..

[6] Norman Biggs,et al. Chip-Firing and the Critical Group of a Graph , 1999 .

[7] Roland Bacher,et al. The lattice of integral flows and the lattice of integral cuts on a finite graph , 1997 .

[8] N. Biggs. Algebraic Potential Theory on Graphs , 1997 .

[9] Dino J. Lorenzini. A finite group attached to the Laplacian of a graph , 1991, Discret. Math..

[10] Evelin Toumpakari,et al. On the sandpile group of regular trees , 2004, Eur. J. Comb..

[11] Lionel Levine. The sandpile group of a tree , 2009, Eur. J. Comb..

[12] The spectra of some trees and bounds for the largest eigenvalue of any tree , 2006 .