A Short Proof for a Lower Bound on the Zero Forcing Number

2017/05/23 by Fürst, M., Rautenbach, D.
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1705.08365

Abstract

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.

Related

• Bounds for the Zero-Forcing Number of Graphs with Large Girth
• Some Bounds on the Zero Forcing Number of a Graph
• Proof of a conjecture on the zero forcing number of a graph
• Bounds on zero forcing using (upper) total domination and minimum degree
• The forcing number of graphs with a given girth