AbstractThe group of recurrent configurations in the sandpile model, introduced by Dhar , may be considered as a finite abelian group associated with any graph G; we call it the sandpile group of G. The aim of this paper is to prove that the sandpile group of planar graph is isomorphic to that of its dual. A combinatorial point of view on the subject is also developed
We study combinatorial aspects of the sandpile model on wheel and fan graphs, seeking bijective char...
The Abelian sandpile models feature a finite Abelian group G generated by the operators correspondin...
AbstractA wired tree is a graph obtained from a tree by collapsing the leaves to a single vertex. We...
The group of recurrent configurations in the sandpile model, introduced by Dhar, may be considered a...
AbstractThe group of recurrent configurations in the sandpile model, introduced by Dhar , may be con...
AbstractThe sandpile group of a connected graph is the group of recurrent configurations in the abel...
AbstractThe sandpile group of a graph is a refinement of the number of spanning trees of the graph a...
Let G be a connected, loopless multigraph. The sandpile group of G is a finite abelian group associa...
The abelian sandpile model on a connected graph yields a finite abelian group Q of recurrent configu...
We introduce two operators on stable configurations of the sandpile model that provide an algorithmi...
AbstractThe sandpile group of a graph is a well-studied object that combines ideas from algebraic gr...
The abelian sandpile model, or chip firing game, is a cellular automaton on finite directed graphs o...
AbstractA polynomial ideal encoding topplings in the abelian sandpile model on a graph is introduced...
The study and the understanding of natural phenomena such as earthquakes, and tidal waves have puzzl...
Sandpiles models have nice physical properties. However, they can also be studied from an algebraic ...
We study combinatorial aspects of the sandpile model on wheel and fan graphs, seeking bijective char...
The Abelian sandpile models feature a finite Abelian group G generated by the operators correspondin...
AbstractA wired tree is a graph obtained from a tree by collapsing the leaves to a single vertex. We...
The group of recurrent configurations in the sandpile model, introduced by Dhar, may be considered a...
AbstractThe group of recurrent configurations in the sandpile model, introduced by Dhar , may be con...
AbstractThe sandpile group of a connected graph is the group of recurrent configurations in the abel...
AbstractThe sandpile group of a graph is a refinement of the number of spanning trees of the graph a...
Let G be a connected, loopless multigraph. The sandpile group of G is a finite abelian group associa...
The abelian sandpile model on a connected graph yields a finite abelian group Q of recurrent configu...
We introduce two operators on stable configurations of the sandpile model that provide an algorithmi...
AbstractThe sandpile group of a graph is a well-studied object that combines ideas from algebraic gr...
The abelian sandpile model, or chip firing game, is a cellular automaton on finite directed graphs o...
AbstractA polynomial ideal encoding topplings in the abelian sandpile model on a graph is introduced...
The study and the understanding of natural phenomena such as earthquakes, and tidal waves have puzzl...
Sandpiles models have nice physical properties. However, they can also be studied from an algebraic ...
We study combinatorial aspects of the sandpile model on wheel and fan graphs, seeking bijective char...
The Abelian sandpile models feature a finite Abelian group G generated by the operators correspondin...
AbstractA wired tree is a graph obtained from a tree by collapsing the leaves to a single vertex. We...
DOI
Add to ORKG