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 particular tiebreaking rule. we assume the tie-breaking rule is prefer-white and we study the relation between the notion of “dynamic monopoly” and “vertex cover” of g. in particular, we show that any vertex cover of g is a dynamic monopoly or reaches a 2−periodic coloring. moreover, we compute dyn(g) for some special classes of graphs including paths, cycles and links of some graphs.