A short proof for a lower bound on the zero forcing number
Maximilian Fürst, Dieter Rautenbach · Discussiones Mathematicae Graph Theory · 2018
We provide a short proof of a conjecture of Davila and Kenter concerning a lower bound on the zero forcing number Z(G) of a graph G. More specifically, we show that Z(G) (g -2)( -2) + 2 for every graph G of girth g at least 3 and minimum degree at least 2.