A Proof of the Grundy domination strong product conjecture

Rebekah Herrman, Stephen G. Z. Smith

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 proper…