Sandpile groups and spanning trees of directed line graphs

DOI10.1016/j.jcta.2010.04.001zbMath1292.05135arXiv0906.2809OpenAlexW2105321516WikidataQ56271083 ScholiaQ56271083MaRDI QIDQ618292

Lionel Levine

Publication date: 14 January 2011

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0906.2809

zbMATH Keywords

critical groupde Bruijn graphKautz graphmatrix-tree theoremoriented spanning treeweighted Laplacianiterated line digraph

Mathematics Subject Classification ID

Trees (05C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Related Items (21)

A new discrete dynamical system of signed integer partitions ⋮ Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles ⋮ The sandpile group of polygon rings and twisted polygon rings ⋮ The critical group of a line graph ⋮ The critical group of a clique-inserted graph ⋮ Enumeration of spanning trees of middle digraphs ⋮ Oriented spanning trees and stationary distribution of digraphs ⋮ Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields ⋮ Stabilizability analysis and switching signals design of switched Boolean networks ⋮ Spanning trees and recurrent configurations of a graph ⋮ Decomposing recurrent states of the Abelian sandpile model ⋮ Critical ideals of signed graphs with twin vertices ⋮ Groups acting on necklaces and sandpile groups ⋮ New proofs for Levine's theorems ⋮ Laplacian matrices and spanning trees of tree graphs ⋮ A note on the number of spanning trees of line digraphs ⋮ Random walks with local memory ⋮ Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals ⋮ Miscellaneous Digraph Classes ⋮ The sandpile group of a polygon flower ⋮ Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the number of spanning trees and Eulerian tours in iterated line digraphs
• Arithmetical graphs
• A finite group attached to the laplacian of a graph
• Asymmetric Abelian sandpile models
• Chip-firing and the critical group of a graph
• Heredity of the index of convergence of the line digraph
• A combinatorial Laplacian with vertex weights
• The critical group of a line graph
• Line Digraph Iterations and the (d, k) Digraph Problem
• Chip-Firing and Rotor-Routing on Directed Graphs
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• Self-organized critical state of sandpile automaton models
• Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs
• Oriented subtrees of an arc digraph

This page was built for publication: Sandpile groups and spanning trees of directed line graphs