Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields
DOI10.1016/j.jalgebra.2014.08.029zbMath1303.05083arXiv1405.0113OpenAlexW2002254231WikidataQ56859905 ScholiaQ56859905MaRDI QIDQ468704
Swee Hong Chan, Henk D. L. Hollmann, Dimitrii V. Pasechnik
Publication date: 7 November 2014
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.0113
Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sandpile groups and spanning trees of directed line graphs
- On the sandpile group of the cone of a graph
- On the sandpile group of the square cycle \(C^{2}_{n}\)
- On the sandpile group of \(3\times n\) twisted bracelets
- A finite group attached to the laplacian of a graph
- Unimodular equivalence of graphs
- Connectivity of consecutive-\(d\) digraphs
- Chip-firing and the critical group of a graph
- Sandpile group on the graph \(\mathcal D_n\) of the dihedral group
- Groups acting on necklaces and sandpile groups
- On the sandpile group of \(P_{4}\times C_n\)
- A Bijective Proof of a Theorem of Knuth
- Chip-Firing and Rotor-Routing on Directed Graphs
- A Design for Directed Graphs with Minimum Diameter
- Generalized de Bruijn digraphs
- Design to Minimize Diameter on Building-Block Network
- Matters Computational
This page was built for publication: Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields
