Cartesian product graphs and $k$-tuple total domination

Adel P. Kazemi, Behnaz Pahlavsay, Rebecca J. Stones

A $k$-tuple total dominating set ($k$TDS) of a graph $G$ is a set $S$ of vertices in which every vertex in $G$ is adjacent to at least $k$ vertices in $S$; the minimum size of a $k…