On a modular domination game.
From MaRDI portal
Recommendations
- \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata
- Lit-only sigma-game on nondegenerate graphs
- Maximum orbit weights in the -game and lit-only -game on grids and graphs
- Completely symmetric configurations for \(\sigma \)-games on grid graphs
- Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?
Cites work
- scientific article; zbMATH DE number 4114031 (Why is no real title available?)
- scientific article; zbMATH DE number 871170 (Why is no real title available?)
- scientific article; zbMATH DE number 1420902 (Why is no real title available?)
- Homotopy and crossings of systems of curves on a surface
- Linear cellular automata and the garden-of-eden
- On the \(p\)-rank of the adjacency matrices of strongly regular graphs
- Parity dimension for graphs
- The mod \(p\) rank of incidence matrices for connected uniform hypergraphs
- The σ-Game and Cellular Automata
- \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata
Cited in
(11)- Lights Out for graphs related to one another by constructions
- A singular quartic curve over a finite field and the trisentis game
- A dice rolling game on a set of tori
- Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs
- On a Group Graded Version of BGG
- Periodic harmonic functions on lattices and points count in positive characteristic
- QUANTUM OCTAL GAMES
- Minimum light number of lit-only \(\sigma\)-game on a tree
- Periodic binary harmonic functions on lattices
- Lights Out On A Random Graph
- Lights Out on graphs
This page was built for publication: On a modular domination game.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1426455)
