Random Lights Out processes on graphs
From MaRDI portal
Publication:394801
DOI10.1016/J.AAM.2013.03.002zbMATH Open1280.05085OpenAlexW2042185700MaRDI QIDQ394801FDOQ394801
Authors: Jacob Hughes
Publication date: 27 January 2014
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aam.2013.03.002
Recommendations
Games on graphs (graph-theoretic aspects) (05C57) Processes in random environments (60K37) Games involving graphs (91A43)
Cites Work
- Title not available (Why is that?)
- Linear cellular automata and the garden-of-eden
- Representations and characters of groups.
- Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?
- Parity dimension for graphs
- \(\sigma\)-Automata and Chebyshev-polynomials
- Lit-only sigma game on a line graph
- Title not available (Why is that?)
- Hitting times for random walks on vertex-transitive graphs
- Characterizing switch-setting problems∗
- Parity Dimension for Graphs - A Linear Algebraic Approach
- A note on Lights-Out-puzzle: parity-state graphs
- Lights Out on finite graphs
Cited In (2)
This page was built for publication: Random Lights Out processes on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394801)