A Proof of the Grundy domination strong product conjecture

Abstract

The Grundy domination number of a simple graph $G=(V,E)$ is the length of the longest sequence of unique vertices $S=(v_1,\dots ,v_k)$, $v_i\in V$, that satisfies the property $N[v_i]\setminus {\cup }_{j=1}^{i-1}N[v_j]\ne \varnothing$ for each $i\in [k]$. Here, $N(v)=\{u:uv\in E\}$ and $N[v]=N(v)\cup \{v\}$. In this note, we prove a recent conjecture about the Grundy domination number of the strong product of two graphs. We then discuss how this result relates to the zero forcing number of the strong product of graphs.

There is an error. Some cases were not considered in the proof of Theorem 1