Characterizing switch-setting problems∗
From MaRDI portal
Publication:4376554
Recommendations
Cited in
(15)- Random Lights Out processes on graphs
- A non-geometric switch toggling problem
- Chasing the lights in Lights Out
- The density of ones in Pascal's rhombus
- Note on the lamp lighting problem
- Minimum light number of lit-only \(\sigma\)-game on a tree
- Maximum orbit weights in the -game and lit-only -game on grids and graphs
- Lights Out On A Random Graph
- A Survey of the Game “Lights Out!”
- Lights Out! On graph products over the ring of integers modulo \(k\)
- ``Lights Out and variants
- On the complexity of dominating set problems related to the minimum all-ones problem
- Parity Dimension for Graphs - A Linear Algebraic Approach
- Cyclic mutually unbiased bases, Fibonacci polynomials and Wiedemann's conjecture
- Lights Out on graphs
This page was built for publication: Characterizing switch-setting problems∗
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376554)