Some bounds on the zero forcing number of a graph

A set Z of vertices of a graph G is a zero forcing set of G if initially labeling all vertices in Z with 0 and all remaining vertices of G with 1, and then, iteratively and as long as possible, changing the label of some vertex u from 1 to 0 if u is the only neighbor with label 1 of some vertex with label 0, results in all vertices of G having label 0. The zero forcing number Z(G), defined as the minimum order of a zero forcing set of G, was proposed as an upper bound of the corank of matrices associated with G, and was also considered in connection with quantum physics and logic circuits. In view of the computational hardness of the zero forcing number, upper and lower bounds are of interest. Refining results of Amos, Caro, Davila, and Pepper, we show that Z(G) <= Delta-2/Delta-1n for a connected graph G of order n and maximum degree Delta at least 3 if and only if G does not belong to {K Delta+1, K-Delta,K-Delta, K-Delta-1,K-Delta, G(1), G(2)}, where G(1) and G(2) are two specific graphs of 5 orders 5 and 7, respectively. For a connected graph G of order n, maximum degree 3, and girth at least 5, we show Z(G) <= n/2 - Omega (n/log n). Using a probabilistic argument, we show Z(G) <= (1 - H-r/r + o (H-r/r)) n for an r-regular graph G of order n and girth at least 5, where Hr is the rth harmonic number. Finally, we show that Z(G) >= (g - 2)(delta - 2) + 2 for a graph G of girth g is an element of {5, 6} and minimum degree delta, which partially confirms a conjecture of Davila and Renter. (C) 2017 Elsevier B.V. All rights reserved.