Lit-only \(\sigma \)-game on pseudo-trees

DOI10.1016/j.dam.2010.08.009zbMath1215.05034OpenAlexW2089263252MaRDI QIDQ608278

Xinmao Wang, Yaokun Wu

Publication date: 25 November 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.08.009

zbMATH Keywords

treeshadow graphrake

Mathematics Subject Classification ID

Trees (05C05)

Related Items (3)

Two-lit trees for lit-only \(\sigma \)-game ⋮ Lit-only sigma-game on nondegenerate graphs ⋮ Solutions to all-colors problem on graph cellular automata

Cites Work

• The edge-flipping group of a graph
• The flipping puzzle on a graph
• Minimum light number of lit-only \(\sigma\)-game on a tree
• 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
• Level-two structure of simply-laced Coxeter groups.
• Linear cellular automata and the garden-of-eden
• The vertex isoperimetric problem for the powers of the diamond graph
• Lit-only sigma game on a line graph
• Note on the lamp lighting problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Lit-only \(\sigma \)-game on pseudo-trees