Maximum orbit weights in the \(\sigma \)-game and lit-only \(\sigma \)-game on grids and graphs
From MaRDI portal
Publication:1043813
DOI10.1007/s00373-009-0841-0zbMath1177.91058OpenAlexW2009989525MaRDI QIDQ1043813
William F. Klostermeyer, John L. Goldwasser
Publication date: 9 December 2009
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-009-0841-0
Related Items
Lit-only \(\sigma \)-game on pseudo-trees ⋮ Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?
Cites Work
- Minimum light number of lit-only \(\sigma\)-game on a tree
- Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?
- Parity dimension for graphs
- Fibonacci polynomials and parity domination in grid graphs
- Linear cellular automata and the garden-of-eden
- Equivalence classes of Vogan diagrams
- Characterizing switch-setting problems∗
- Note on the lamp lighting problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Maximum orbit weights in the \(\sigma \)-game and lit-only \(\sigma \)-game on grids and graphs