Does the lit-only restriction make any difference for the -game and ^+-game?

DOI10.1016/J.EJC.2008.09.020zbMATH Open1169.91011OpenAlexW2031414850MaRDI QIDQ1024268FDOQ1024268

Authors: Xinmao Wang, Yaokun Wu, John Goldwasser 

Publication date: 17 June 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2008.09.020

Recommendations

• Maximum orbit weights in the \(\sigma \)-game and lit-only \(\sigma \)-game on grids and graphs
• Lit-only sigma-game on nondegenerate graphs
• Two-lit trees for lit-only \(\sigma \)-game
• Minimum light numbers in the \(\sigma \)-game and lit-only \(\sigma \)-game on unicyclic and grid graphs
• Lit-only \(\sigma \)-game on pseudo-trees

zbMATH Keywords

line graphreachabilityorbitconfigurationlit-only sigma gametoggle

Mathematics Subject Classification ID

Games involving graphs (91A43) Combinatorial games (91A46)

Cites Work

• Linear cellular automata and the garden-of-eden
• Title not available (Why is that?)
• Extended Vogan diagrams
• Harmonic evolutions on graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complexity of reachability problems for finite discrete dynamical systems
• Eriksson's numbers game and finite Coxeter groups
• More about singular line graphs of trees
• Periodic binary harmonic functions on lattices
• Chebyshev polynomials over finite fields and reversibility of \(\sigma\)-automata on square grids
• Universal configurations in light-flipping games
• Maximum orbit weights in the \(\sigma \)-game and lit-only \(\sigma \)-game on grids and graphs
• Title not available (Why is that?)
• Note on the lamp lighting problem
• Minimum light number of lit-only \(\sigma\)-game on a tree
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reachability is decidable in the numbers game
• Title not available (Why is that?)
• Parity dominating sets in grid graphs
• Even poset and a parity result for binary linear code
• Puzzlers' tribute. A feast for the mind
• The Minimum All-Ones Problem for Trees
• A quick proof on the equivalence classes of extended Vogan diagrams
• On irreversibility of von Neumann additive cellular automata on grids
• Title not available (Why is that?)
• On characterization of state transition graph of additive cellular automata based on depth
• On the complexity of dominating set problems related to the minimum all-ones problem
• Linear algebra approach to geometric graphs
• Generalized switch-setting problems
• QUANTUM OCTAL GAMES

Cited In (12)

• Random Lights Out processes on graphs
• Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs
• On the adjacency matrix of a block graph
• Periodic harmonic functions on lattices and points count in positive characteristic
• On a modular domination game.
• Lit-only \(\sigma \)-game on pseudo-trees
• The edge-flipping group of a graph
• Maximum orbit weights in the \(\sigma \)-game and lit-only \(\sigma \)-game on grids and graphs
• Two-lit trees for lit-only \(\sigma \)-game
• The lit-only \(\sigma\)-game: some mathematics behind a puzzle for kids
• Lit-only sigma-game on nondegenerate graphs
• Completely symmetric configurations for \(\sigma \)-games on grid graphs

This page was built for publication: Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?

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