A short proof for a lower bound on the zero forcing number
Copyright policy )A short proof for a lower bound on the zero forcing number
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)(δ-2)+2$ for every graph $G$ of girth $g$ at least $3$ and minimum degree $δ$ at least $2$.
- Ulm University (UULM) Germany
- University of Ulm Germany
Graphs and linear algebra (matrices, eigenvalues, etc.), Moore bound, zero forcing, girth, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), 05c69, QA1-939, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Mathematics, moore bound
Graphs and linear algebra (matrices, eigenvalues, etc.), Moore bound, zero forcing, girth, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), 05c69, QA1-939, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Mathematics, moore bound
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).5 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!