Game domination number
✍ Scribed by Noga Alon; József Balogh; Béla Bollobás; Tamás Szabó
- Book ID
- 108315581
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 103 KB
- Volume
- 256
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Damaschke, P., Irredundance number versus domination number, Discrete Mathematics 89 (1991) 101-104. The domination number y(G) and the irredundance number ir(G) of a graph G have been considered by many authors from a graph-theoretic or from an algorithmic point of view. In this graph-theoretic pap
We present a generalization of the so-called -game, introduced by Sutner (Math. Intelligencer 11 (1989) 49), a combinatorial game played on a graph, with relations to cellular automata, as well as odd domination in graphs. A conÿguration on a graph is an assignment of values in {0; : : : ; p -1} (wh