Power domination throttling

Boris Brimkov, Joshua Carlson, Illya V. Hicks +2

A power dominating set of a graph $G=(V,E)$ is a set $S\subset V$ that colors every vertex of $G$ according to the following rules: in the first timestep, every vertex in $N[S]$ be…