The article considers the procedure of connection of graphs to the edges of a cyclic graph and its influence on the sandpile group of the graph thus obtained. A series of classes of graphs CHn(a1,..., an) is defined. Re-current and non-recurrent formulas for calculating the sandpile groups of all graphs of classes CHn(a1,..., an) are proposed
We investigate the abelian sandpile group on modified wheels Wˆn{\hat{W}}_{n} by using a variant of ...
AbstractA wired tree is a graph obtained from a tree by collapsing the leaves to a single vertex. We...
A maximal minor M of the Laplacian of an n-vertex Eulerian digraph Γ gives rise to a finite group Zn...
AbstractThe sandpile group of a graph is a refinement of the number of spanning trees of the graph a...
AbstractThe sandpile group of a graph is a refinement of the number of spanning trees of the graph a...
AbstractThe sandpile group of a graph is a refinement of the number of spanning trees of the graph a...
AbstractThe sandpile group of a graph is an abelian group that arises in several contexts, and a ref...
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...
Abstract. We generalize a theorem of Knuth relating the ori-ented spanning trees of a directed graph...
AbstractIn this article, we study the sandpile group of the cone of a graph. After introducing the c...
We introduce two operators on stable configurations of the sandpile model that provide an algorithmi...
AbstractThe sandpile group of a connected graph is the group of recurrent configurations in the abel...
Abstract. We introduce two operators on stable configurations of the sandpile model that provide an ...
Abstract. We describe a short exact sequence relating the sandpile group of a tree to those of its p...
We investigate the abelian sandpile group on modified wheels Wˆn{\hat{W}}_{n} by using a variant of ...
AbstractA wired tree is a graph obtained from a tree by collapsing the leaves to a single vertex. We...
A maximal minor M of the Laplacian of an n-vertex Eulerian digraph Γ gives rise to a finite group Zn...
AbstractThe sandpile group of a graph is a refinement of the number of spanning trees of the graph a...
AbstractThe sandpile group of a graph is a refinement of the number of spanning trees of the graph a...
AbstractThe sandpile group of a graph is a refinement of the number of spanning trees of the graph a...
AbstractThe sandpile group of a graph is an abelian group that arises in several contexts, and a ref...
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...
Abstract. We generalize a theorem of Knuth relating the ori-ented spanning trees of a directed graph...
AbstractIn this article, we study the sandpile group of the cone of a graph. After introducing the c...
We introduce two operators on stable configurations of the sandpile model that provide an algorithmi...
AbstractThe sandpile group of a connected graph is the group of recurrent configurations in the abel...
Abstract. We introduce two operators on stable configurations of the sandpile model that provide an ...
Abstract. We describe a short exact sequence relating the sandpile group of a tree to those of its p...
We investigate the abelian sandpile group on modified wheels Wˆn{\hat{W}}_{n} by using a variant of ...
AbstractA wired tree is a graph obtained from a tree by collapsing the leaves to a single vertex. We...
A maximal minor M of the Laplacian of an n-vertex Eulerian digraph Γ gives rise to a finite group Zn...