Grundy domination and zero forcing in regular graphs

Boštjan Brešar, Simon Brezovnik

Given a finite graph $G$, the maximum length of a sequence $(v_1,\dots ,v_k)$ of vertices in $G$ such that each $v_i$ dominates a vertex that is not dominated by any vertex in $\{v…