A note on total and paired domination of Cartesian product graphs (Q396841)

Summary: 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 dominating set in \(G\). Vizing's conjecture [\textit{V. G. Vizing}, Russ. Math. Surv. 23, No. 6, 125--141 (1968); translation from Usp. Mat. Nauk 23, No. 6(144), 117--134 (1968; Zbl 0192.60502)] states that for the Cartesian product of graphs \(G\) and \(H, \gamma(G)\gamma(H) \leq \gamma(G \square H)\), and \textit{W. Clark} and \textit{S. Suen} [Electron. J. Comb. 7, No. 1, Notes N4, 3 p. (2000; Zbl 0947.05056)] proved that \(\gamma(G)\gamma(H) \leq 2 \gamma(G \square H)\). In this paper, we modify the approach of Clark and Suen [loc. cit.] to prove a variety of similar bounds related to total and paired domination, and also extend these bounds to the \(n\)-Cartesian product of graphs \(A^1\) through \(A^n\).