论文信息 - Chip-Firing and the Critical Group of a Graph

Chip-Firing and the Critical Group of a Graph

A variant of the chip-firing game on a graph is defined. It is shown that the set of configurations that are stable and recurrent for this game can be given the structure of an abelian group, and that the order of the group is equal to the tree number of the graph. In certain cases the game can be used to illuminate the structure of the group.

Norman Biggs | N. Biggs

[1] László Lovász,et al. Chip-firing Games on Graphs , 1991, Eur. J. Comb..

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

[3] Peter Rowlinson. Surveys in combinatorics, 1995 , 1995 .

[4] A. Neumaier,et al. Distance Regular Graphs , 1989 .

[5] Peter Winkler,et al. Mixing of random walks and other diffusions on a graph , 1995 .

[6] Frank Harary,et al. Graph Theory , 2016 .

[7] R. M. Damerell,et al. Recursive families of graphs , 1972 .

[8] László Lovász,et al. Chip-Firing Games on Directed Graphs , 1992 .

[9] A. Gabrielov. Avalanches, Sandpiles and Tutte Decomposition , 1993 .

[10] P. Harpe,et al. The lattice of integral flows and the lattice of integral coboundaries on a finite graph , 1995 .

[11] Andrei Gabrielov,et al. Abelian avalanches and Tutte polynomials , 1993 .

[12] A. Brouwer,et al. On the p-Rank of the Adjacency Matrices of Strongly Regular Graphs , 1992 .