Lit-only sigma game on a line graph

DOI10.1016/j.ejc.2008.02.003zbMath1166.91010OpenAlexW2121594428MaRDI QIDQ2519798

Yaokun Wu

Publication date: 27 January 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.02.003

zbMATH Keywords

treecovering radiusorbitsymmetric groupline graphisoperimetric numberlit-only sigma gameminimum light number

Mathematics Subject Classification ID

Combinatorial games (91A46)

Related Items (7)

Lit-only \(\sigma \)-game on pseudo-trees ⋮ Random Lights Out processes on graphs ⋮ The edge-flipping group of a graph ⋮ Lit-only sigma-game on nondegenerate graphs ⋮ The flipping puzzle on a graph ⋮ Minimum light number of lit-only \(\sigma\)-game on a tree ⋮ Solutions to all-colors problem on graph cellular automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The covering radius of the cycle code of a graph
• Minimum light number of lit-only \(\sigma\)-game on a tree
• Bounds on isoperimetric values of trees
• Linear cellular automata and the garden-of-eden
• Equivalence classes of Vogan diagrams
• Computing the isoperimetric number of a graph
• Extended Vogan diagrams
• Note on the lamp lighting problem

This page was built for publication: Lit-only sigma game on a line graph