On the disjunctive domination numbers of the torus grid graphs

Abstract: Let $Γ=(V,E)$ be a graph. A disjunctive dominating set in $Γ$ is a set $S\subseteq V$ such that every vertex not in $S$ is adjacent to a vertex of $S$, or has at least two vertices in $S$ at distance $2$ from it. The minimum cardinality of a disjunctive dominating set in $Γ$ is called the disjunctive domination number of $Γ$. In this paper, we give bounds for the disjunctive domination numbers of the torus grid graphs $C_m\Box C_n$, and determine the disjunctive domination numbers of $C_3\Box C_n$ and $C_4\Box C_n$.