M. Fürst, D. Rautenbach
A short proof for a lower bound on the zero forcing number
Discussiones Mathematicae Graph Theory
Received 31.05.2017, Revised 26.02.2018, Accepted 26.02.2018, doi: 10.7151/dmgt.2117
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.
zero forcing, girth, Moore bound