Minimum light number of lit-only \(\sigma\)-game on a tree

DOI10.1016/j.tcs.2007.05.033zbMath1188.68207arXiv0904.3050OpenAlexW2050815478MaRDI QIDQ995589

Yaokun Wu, Xinmao Wang

Publication date: 3 September 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0904.3050

zbMATH Keywords

orbitHamming weightleavesbinary field

Mathematics Subject Classification ID

Trees (05C05) Combinatorics in computer science (68R05) Games involving graphs (91A43)

Related Items (8)

Lit-only \(\sigma \)-game on pseudo-trees ⋮ Two-lit trees for lit-only \(\sigma \)-game ⋮ The edge-flipping group of a graph ⋮ Lit-only sigma-game on nondegenerate graphs ⋮ The flipping puzzle on a graph ⋮ Lit-only sigma game on a line graph ⋮ Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game? ⋮ Maximum orbit weights in the \(\sigma \)-game and lit-only \(\sigma \)-game on grids and graphs

Cites Work

• Chebyshev polynomials over finite fields and reversibility of \(\sigma\)-automata on square grids
• \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata
• Deterministic one-dimensional cellular automata
• Multidimensional \(\sigma\)-automata, \(\pi\)-polynomials and generalised S-matrices
• On a modular domination game.
• Parity dimension for graphs
• Linear cellular automata with boundary conditions
• Linear cellular automata and the garden-of-eden
• Equivalence classes of Vogan diagrams
• \(\sigma\)-Automata and Chebyshev-polynomials
• On irreversibility of von Neumann additive cellular automata on grids
• Extended Vogan diagrams
• Linear algebraic approach on real \(\sigma\)-game
• Lit-only sigma game on a line graph
• Characterizing switch-setting problems^∗
• The Minimum All-Ones Problem for Trees
• The σ-Game and Cellular Automata
• Parity Dimension for Graphs - A Linear Algebraic Approach
• The Parametrized Complexity of Some Fundamental Problems in Coding Theory
• Note on the lamp lighting problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum light number of lit-only \(\sigma\)-game on a tree