Sandpile groups and spanning trees of directed line graphs

Abstract

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.

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.

Cited by in corpus (17)

• Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs
• Synthesis and analysis in total variation regularization
• Oriented Hypergraphic Matrix-tree Type Theorems and Bidirected Minors via Boolean Order Ideals
• Laplacian matrices and spanning trees of tree graphs
• Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields
• Counting the spanning trees of a directed line graph
• Random walks with local memory
• Solution manifold and Its Statistical Applications
• Automorphisms of necklaces and sandpile groups
• Algebraic and combinatorial aspects of sandpile monoids on directed graphs
• Oriented spanning trees and stationary distribution of digraphs
• The Abelian Sandpile Model on Fractal Graphs
• Critical groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields: an extended abstract
• The sandpile group of a polygon flower
• Notes on identical configurations in Abelian Sandpile Model with initial height
• Enumeration of spanning trees of middle graphs
• Enumeration and Quasipolynomiality of Chip-Firing Configurations