Dynamic monopolies in simple graphs
This paper studies a repetitive polling game played on an $n$-vertex graph $G$. At first, each vertex is colored, Black or White. At each round, each vertex (simultaneously) recolors itself by the color of the majority of its closed neighborhood. The variants of the model differ in the choice of a p...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Amirkabir University of Technology
2025-02-01
|
| Series: | AUT Journal of Mathematics and Computing |
| Subjects: | |
| Online Access: | https://ajmc.aut.ac.ir/article_5350_2bb6c5d854497148d55a2f5aeaa8486f.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|