AbstractThe sandpile group of a graph is a refinement of the number of spanning trees of the graph and is closely connected with the graph Laplacian matrix. In this paper, the structure of the sandpile group on the graph K3×Cn is determined and it is shown that the Smith normal form of the sandpile group of K3×Cn is always the direct sum of four or five cyclic groups. Our methods can be generated to the graphs K4×Cn and K5×Cn
AbstractThe sandpile group of a connected graph is the group of recurrent configurations in the abel...
Abstract. We describe a short exact sequence relating the sandpile group of a tree to those of its p...
AbstractA wired tree is a graph obtained from a tree by collapsing the leaves to a single vertex. We...
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...
Abstract. We generalize a theorem of Knuth relating the ori-ented spanning trees of a directed graph...
The article considers the procedure of connection of graphs to the edges of a cyclic graph and its i...
A maximal minor M of the Laplacian of an n-vertex Eulerian digraph Γ gives rise to a finite group Zn...
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...
AbstractWe generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G ...
AbstractLet M denote the Laplacian matrix of a graph G. Associated with G is a finite group Φ(G), ob...
A maximal minor $M$ of the Laplacian of an $n$-vertex Eulerian digraph $\Gamma$ gives rise to a fini...
AbstractThe sandpile group of a connected graph is the group of recurrent configurations in the abel...
Abstract. We describe a short exact sequence relating the sandpile group of a tree to those of its p...
AbstractA wired tree is a graph obtained from a tree by collapsing the leaves to a single vertex. We...
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...
Abstract. We generalize a theorem of Knuth relating the ori-ented spanning trees of a directed graph...
The article considers the procedure of connection of graphs to the edges of a cyclic graph and its i...
A maximal minor M of the Laplacian of an n-vertex Eulerian digraph Γ gives rise to a finite group Zn...
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...
AbstractWe generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G ...
AbstractLet M denote the Laplacian matrix of a graph G. Associated with G is a finite group Φ(G), ob...
A maximal minor $M$ of the Laplacian of an $n$-vertex Eulerian digraph $\Gamma$ gives rise to a fini...
AbstractThe sandpile group of a connected graph is the group of recurrent configurations in the abel...
Abstract. We describe a short exact sequence relating the sandpile group of a tree to those of its p...
AbstractA wired tree is a graph obtained from a tree by collapsing the leaves to a single vertex. We...
DOI
Add to ORKG