On the largest dynamic monopolies of graphs with a given average threshold

Kaveh Khoshkhah, Manouchehr Zaker

Let $G$ be a graph and $\tau$ be an assignment of nonnegative integer thresholds to the vertices of $G$. A subset of vertices $D$ is said to be a $\tau$-dynamic monopoly, if $V(G)$ can b…