Geodesic
Chip-firing and the critical group of a graph
Journal of Algebraic Combinatorics, Tome 9 (1999) no. 1, pp. 25-45.

Voir la notice de l'article provenant de la source Electronic Library of Mathematics

Summary: 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.
Keywords: chip-firing, discrete Laplacian, tree number, invariant factors 
@article{JAC_1999__9_1_a2,
     author = {Biggs, N.L.},
     title = {Chip-firing and the critical group of a graph},
     journal = {Journal of Algebraic Combinatorics},
     pages = {25--45},
     publisher = {mathdoc},
     volume = {9},
     number = {1},
     year = {1999},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/JAC_1999__9_1_a2/}
}
TY  - JOUR
AU  - Biggs, N.L.
TI  - Chip-firing and the critical group of a graph
JO  - Journal of Algebraic Combinatorics
PY  - 1999
SP  - 25
EP  - 45
VL  - 9
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/JAC_1999__9_1_a2/
LA  - en
ID  - JAC_1999__9_1_a2
ER  - 
%0 Journal Article
%A Biggs, N.L.
%T Chip-firing and the critical group of a graph
%J Journal of Algebraic Combinatorics
%D 1999
%P 25-45
%V 9
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/JAC_1999__9_1_a2/
%G en
%F JAC_1999__9_1_a2
Biggs, N.L. Chip-firing and the critical group of a graph. Journal of Algebraic Combinatorics, Tome 9 (1999) no. 1, pp. 25-45. http://geodesic.mathdoc.fr/item/JAC_1999__9_1_a2/