Properties of chip-firing games on complete graphs

DOI10.1007/S40840-014-0101-1zbMATH Open1322.05096OpenAlexW1974466493MaRDI QIDQ745934FDOQ745934

Lianzhu Zhang, Weihua Yang, Xiaofeng Guo, Wei Zhuang

Publication date: 15 October 2015

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-014-0101-1

zbMATH Keywords

complete graphschip-firing gamesinfinite configuration

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Cites Work

• Title not available (Why is that?)
• Chip-firing and the critical group of a graph
• Chip firing and the Tutte polynomial
• On the sandpile group of dual graphs
• Self-organized critical state of sandpile automaton models
• Chip-firing games on graphs
• Balancing vectors in the max norm
• A chip-firing game and Dirichlet eigenvalues
• The chip-firing game
• Chip-firing games on directed graphs
• Polynomial Bound for a Chip Firing Game on Graphs
• The chip firing game on \(n\)-cycles
• Algorithmic aspects of a chip-firing game

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Properties of chip-firing games on complete graphs

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