Perfect domination in rectangular grid graphs

Italo J. Dejter, Abel A. Delgado

A dominating set $S$ in a graph $G$ is said to be perfect if every vertex of $G$ not in $S$ is adjacent to just one vertex of $S$. Given a vertex subset $S^{\prime }$ of a side $P_m$ of an…