Dynamic monopolies and feedback vertex sets in hexagonal grids

@article{Adams2011DynamicMA,
title={Dynamic monopolies and feedback vertex sets in hexagonal grids},
author={Sarah Spence Adams and Denise Sakai Troxell and S. Luke Zinnen},
journal={Computers & Mathematics with Applications},
year={2011},
volume={62},
pages={4049-4057}
}

In a majority conversion process, the vertices of a graph can be in one of the two states, colored or uncolored, and these states are dynamically updated so that a vertex becomes colored at a certain time period if at least half of its neighbors were in the colored state in the previous time period. A dynamic monopoly is a set of vertices in a graph that when initially coloredwill eventually cause all vertices in the graph to become colored. This paper establishes a connection between… CONTINUE READING