The [formula omitted] broadcast domination number of some regular graphs.

The (t , r) broadcast domination is a generalization of domination in a graph. In this paper we prove a conjecture by Drews, Harris, and Randolph about the minimal density of towers in Z 2 that provide a (t , 3) domination broadcast for t ≥ 17 and explore generalizations. Additionally, we determine the (t , r) broadcast domination number of powers of paths, P n (k) and powers of cycles, C n (k) . [ABSTRACT FROM AUTHOR]