A Note on Total and Paired Domination of Cartesian Product Graphs

K. Choudhary, S. Margulies, I. V. Hicks

A dominating set $D$ for a graph $G$ is a subset of $V(G)$ such that any vertex not in $D$ has at least one neighbor in $D$. The domination number $\gamma (G)$ is the size of a minimum d…