Minimal recurrent configuration of a graph

MaRDI QIDQ5400162zbMATH OpenFDO

Authors Erxia Meng, Aixiang Fang, Yaoping Hou

Publication date 28 February 2014

zbMATH Keywords

recurrent configurationsandpile modeloperation of graphsminimal recurrent configuration

Mathematics Subject Classification ID

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

Recommendations

• The recurrent configurations on some graphs
• Compatible recurrent identities of the sandpile group and maximal stable configurations
• Minimal recurrent configurations of chip firing games and directed acyclic graphs
• On the sandpile group of Eulerian series-parallel graphs
• On the Addition of Recurrent Configurations of the Sandpile-Model

Cited in

(7)

• Compatible recurrent identities of the sandpile group and maximal stable configurations
• Addition of recurrent configurations in chip firing games: finding minimal recurrent configurations with Markov chains
• Minimal configurations and sandpile measures
• Minimal recurrent configurations of chip firing games and directed acyclic graphs
• Minimal configuration bicyclic graphs
• On the Addition of Recurrent Configurations of the Sandpile-Model
• The recurrent configurations on some graphs

This page was built for publication: Minimal recurrent configuration of a graph

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