This paper considers a repetitive polling game played on an n-vertex graph G. Initially, each vertex is colored black or white. At each round, each vertex (simultaneously) recolors itself by the color of the majority of its neighborhood. A set of vertices M is said to be a dynamic monopoly, abbrevia
Dynamic Monopolies of Constant Size
โ Scribed by Eli Berger
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 168 KB
- Volume
- 83
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
โฆ Synopsis
The paper deals with a polling game on a graph. Initially, each vertex is colored white or black. At each round, each vertex is colored by the color shared by the majority of vertices in its neighborhood, at the previous round. (All recolorings are done simultaneously.) We say that a set W 0 of vertices is a dynamic monopoly or dynamo if starting the game with the vertices of W 0 colored white, the entire system is white after a finite number of rounds. D. Peleg (1998, Discrete Appl. Math. 86, 262 273) asked how small a dynamic monopoly may be as a function of the number of vertices. We show that the answer is O(1).
๐ SIMILAR VOLUMES
The stability region of the dynamic lot size problem understood as the set of cost parameter inputs for which an optimal solution remains valid has been studied in various papers of V6r6s and the author. Recently van Hoesel and Wagelmans discussed these results and suggested some numerical improveme
The magnitude of the 45 proton-proton coupling constant across the fragment CH3-C-C-H (a probe of the bond order between the central spz-sp2 hybridized carbon atoms) has been found to be essentially independent of substitution on a toluene fragment and on the size of the ring containing the ortho-al