✦ LIBER ✦

Sandpile Groups and the Join of Graphs

✍ Scribed by Krepkiy, I. A

Book ID: 121581396
Publisher: Springer US
Year: 2014
Tongue: English
Weight: 205 KB
Volume: 196
Category: Article
ISSN: 1573-8795
DOI: 10.1007/s10958-013-1650-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the sandpile group of the graph

✍ Yaoping Hou; Tiangang Lei; Chingwah Woo 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 166 KB

On the Sandpile Group of Dual Graphs

✍ Robert Cori; Dominique Rossin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 205 KB

The group of recurrent configurations in the sandpile model, introduced by Dhar [7], 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 dua

On the sandpile group of the cone of a g

On the sandpile group of the cone of a graph

✍ Carlos A. Alfaro; Carlos E. Valencia 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 672 KB

The abelian sandpile model on randomly r

The abelian sandpile model on randomly rooted graphs and self-similar groups

✍ Matter, M.; Nagnibeda, T. 📂 Article 📅 2013 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 1009 KB

Sandpile Dynamics on Random Graphs

✍ Bonabeau, Eric 📂 Article 📅 1995 🏛 Institute of Pure and Applied Physics 🌐 English ⚖ 221 KB

On the minimum rank of the join of graph

On the minimum rank of the join of graphs and decomposable graphs

✍ Francesco Barioli; Shaun Fallat 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 184 KB

For a given undirected graph G, the minimum rank of G is defined to be the smallest possible rank over all real symmetric matrices A whose (i, j )th entry is nonzero whenever i / = j and {i, j } is an edge in G. In this work we consider joins and unions of graphs, and characterize the minimum rank o