arXiv:0906.2809 [math.CO]AbstractReferencesReviewsResources
Sandpile groups and spanning trees of directed line graphs
Published 2009-06-15, updated 2010-04-06Version 2
We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associated to a directed graph, whose order is the number of oriented spanning trees rooted at a fixed vertex. In the case when G is regular of degree k, we show that the sandpile group of G is isomorphic to the quotient of the sandpile group of LG by its k-torsion subgroup. As a corollary we compute the sandpile groups of two families of graphs widely studied in computer science, the de Bruijn graphs and Kautz graphs.
Comments: v2 has an expanded section on deletion/contraction for directed graphs, and a more detailed proof of Theorem 2.3. To appear in Journal of Combinatorial Theory A.
Categories: math.CO
Keywords: sandpile group, oriented spanning trees, directed line graph lg, directed graph, computer science
Tags: journal article
Related articles: Most relevant | Search more
On the Sandpile group of the cone of a graph
The Sandpile Group of a Tree
arXiv:math/0403219 [math.CO] (Published 2004-03-13)
On the sandpile group of regular trees