The recurrent configurations on some graphs
From MaRDI portal
Publication:4901707
Recommendations
- Minimal recurrent configuration of a graph
- Compatible recurrent identities of the sandpile group and maximal stable configurations
- The abelian sandpile model on Ferrers graphs -- a classification of recurrent configurations
- Decomposing recurrent states of the abelian sandpile model
- Spanning trees and recurrent configurations of a graph
Cited in
(13)- Minimal sandpiles on hexagonal lattice
- A recurrence template for several parameters in series-parallel graphs
- Spanning trees and recurrent configurations of a graph
- Decomposing recurrent states of the abelian sandpile model
- Compatible recurrent identities of the sandpile group and maximal stable configurations
- Permutation graphs and the abelian sandpile model, tiered trees and non-ambiguous binary trees
- The abelian sandpile model on Ferrers graphs -- a classification of recurrent configurations
- Combinatorial aspects of sandpile models on wheel and Fan graphs
- Repetitions in graphs and sequences
- scientific article; zbMATH DE number 5688299 (Why is no real title available?)
- Addition of recurrent configurations in chip firing games: finding minimal recurrent configurations with Markov chains
- Decomposing recurrent states of the abelian sandpile model
- Minimal recurrent configuration of a graph
This page was built for publication: The recurrent configurations on some graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4901707)