Generalized switch-setting problems

DOI10.1016/J.DISC.2006.11.021MaRDI QIDQ2461202zbMATH OpenOpenAlexFDO

Authors Torsten Mütze

Publication date 27 November 2007

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2006.11.021

zbMATH Keywords

bipartite graphlights outparity dominationMerlin's magic squareswitch-setting game

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Linear programming (90C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 6374006
• Lights Out on graphs
• A Survey of the Game “Lights Out!”
• On a switch-setting problem arising from a variation of the `Lights Out' game
• A group-labeling version of the Lights Out game

Cites work

• scientific article; zbMATH DE number 3528420 (Why is no real title available?)
• scientific article; zbMATH DE number 894703 (Why is no real title available?)
• Chebyshev polynomials over finite fields and reversibility of \(\sigma\)-automata on square grids
• Fibonacci polynomials and parity domination in grid graphs
• How to turn all the lights out
• Linear cellular automata and the garden-of-eden
• Merlin's Magic Square
• Merlin's Magic Square Revisited
• Note on the lamp lighting problem
• The σ-Game and Cellular Automata
• Universal configurations in light-flipping games
• \(\sigma\)-Automata and Chebyshev-polynomials
• \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata

Cited in

(3)

• A non-geometric switch toggling problem
• Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?
• A Confused Electrician Uses Smith Normal Form

This page was built for publication: Generalized switch-setting problems

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