Avalanche polynomials of some families of graphs

MaRDI QIDQ3154667zbMATH OpenFDO

Authors Robert Cori, Arnaud Dartois, Dominique Rossin

Publication date 14 January 2005

zbMATH Keywords

abelian sandpile modelavalanche polynomialsparking functions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Graph theory (05C99) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Review text

In this paper, the abelian sandpile model has been studied on different families of graphs. The authors introduced the avalanche polynomial which enumerates the size of the avalanches triggered by the addition of a particle on a recurrent configuration. This polynomial is calculated for several families of graphs. In the case of complete graphs, the result involves a known result on parking functions. For the entire collection see [Zbl 1047.68003].

Recommendations

• The multivariate avalanche polynomial
• Acyclic polynomials of graphs
• scientific article; zbMATH DE number 3843776
• A result on polynomials derived via graph theory
• scientific article; zbMATH DE number 13137
• Fubini numbers and polynomials of graphs
• The graph polynomials and their equivalence
• Chain polynomials of graphs
• Polynomial sequences of binomial-type arising in graph theory
• A graph-theoretic approach to Jacobsthal polynomials

Cited in

(4)

• Spanning trees and recurrent configurations of a graph
• The multivariate avalanche polynomial
• Avalanche sizes of the abelian sandpile model on unicyclic graphs
• A note on the lacking polynomial of the complete bipartite graph

This page was built for publication: Avalanche polynomials of some families of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3154667)