  This paper presents strong connections between four variants of the zero
forcing number and four variants of the Grundy domination number. These
connections bridge the domination problem and the minimum rank problem. We show
that the Grundy domination type parameters are bounded above by the minimum
rank type parameters. We also give a method to calculate the $L$-Grundy
domination number by the Grundy total domination number, giving some linear
algebra bounds for the $L$-Grundy domination number.
