Lit-only sigma game on a line graph
From MaRDI portal
Publication:2519798
DOI10.1016/j.ejc.2008.02.003zbMath1166.91010MaRDI QIDQ2519798
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
tree; covering radius; orbit; symmetric group; line graph; isoperimetric number; lit-only sigma game; minimum light number
91A46: Combinatorial games
Related Items
Random Lights Out processes on graphs, Lit-only \(\sigma \)-game on pseudo-trees, The edge-flipping group of a graph, The flipping puzzle on a graph, Minimum light number of lit-only \(\sigma\)-game on a tree, Lit-only sigma-game on nondegenerate graphs, Solutions to all-colors problem on graph cellular automata
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item