In a graph G = (V, E), a set M ? V (G) is said to be a monopoly set of G if every vertex v ? V ? M has, at least, d(v)/2 neighbors in M. The monopoly size of G, denoted by mo(G), is the minimum cardinality of a monopoly ...