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

M. Fürst; D. Rautenbach

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

Combinatorics 2017-05-24 v1

Authors: M. Fürst , D. Rautenbach

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)\geq (g-2)(\delta-2)+2$ for every graph $G$ of girth $g$ at least $3$ and minimum degree $\delta$ at least $2$ .

Keywords

zero forcing in graphs graph pebbling hadwiger conjecture

Cite

@article{arxiv.1705.08365,
  title  = {A Short Proof for a Lower Bound on the Zero Forcing Number},
  author = {M. Fürst and D. Rautenbach},
  journal= {arXiv preprint arXiv:1705.08365},
  year   = {2017}
}

Related papers

View all related →