Sandpile groups and the join of graphs

DOI10.1007/S10958-013-1650-9MaRDI QIDQ744542zbMATH OpenOpenAlexFDO

Authors I. A. Krepkiy

Publication date 25 September 2014

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10958-013-1650-9

zbMATH Keywords

multigraphs without loops

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• On the sandpile group of a family of graphs
• The sandpile groups of chain-cyclic graphs
• The sandpile group of a family of nearly complete graphs
• Sandpile groups of random bipartite graphs
• The structure of sandpile groups of outerplanar graphs
• Sandpile groups and spanning trees of directed line graphs
• On the sandpile group of dual graphs
• The sandpile group of a thick cycle graph
• On the sandpile group of the cone of a graph
• Sandpile groups and the coeulerian property for random directed graphs

Cites work

• Chip-Firing and Rotor-Routing on Directed Graphs

Cited in

(5)

• The sandpile group of a family of nearly complete graphs
• On the sandpile group of Eulerian series-parallel graphs
• The sandpile groups of chain-cyclic graphs
• On the sandpile group of the cone of a graph
• Applying the Kirchhoff relations in proofs of theorems on graph operations that do not affect the structure of the sandpile groups of graphs

This page was built for publication: Sandpile groups and the join of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744542)