On $(t,r)$ broadcast domination of certain grid graphs

Natasha Crepeau, Pamela E. Harris, Sean Hays +4

Let $G=(V(G),E(G))$ be a connected graph with vertex set $V(G)$ and edge set $E(G)$. We say a subset $D$ of $V(G)$ dominates $G$ if every vertex in $V\setminus D$ is adjacent t…