On a modular domination game.

DOI10.1016/S0304-3975(03)00285-8zbMath1060.68076OpenAlexW1965913229MaRDI QIDQ1426455

Mehdi Mhalla, Sylvain Gravier, Eric Tannier

Publication date: 14 March 2004

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00285-8

zbMATH Keywords

DominationCombinatorial game

Mathematics Subject Classification ID

Games involving graphs (91A43) Cellular automata (computational aspects) (68Q80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial games (91A46)

Related Items (9)

Lights Out for graphs related to one another by constructions ⋮ Lights Out On A Random Graph ⋮ Periodic binary harmonic functions on lattices ⋮ A singular quartic curve over a finite field and the trisentis game ⋮ Minimum light number of lit-only \(\sigma\)-game on a tree ⋮ QUANTUM OCTAL GAMES ⋮ Periodic harmonic functions on lattices and points count in positive characteristic ⋮ Lights Out on graphs ⋮ Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata
• On the \(p\)-rank of the adjacency matrices of strongly regular graphs
• Homotopy and crossings of systems of curves on a surface
• The mod \(p\) rank of incidence matrices for connected uniform hypergraphs
• Parity dimension for graphs
• Linear cellular automata and the garden-of-eden
• The σ-Game and Cellular Automata

This page was built for publication: On a modular domination game.