A short proof for a lower bound on the zero forcing number
From MaRDI portal
Publication:2282488
DOI10.7151/dmgt.2117zbMath1430.05088arXiv1705.08365OpenAlexW2963554500MaRDI QIDQ2282488
Dieter Rautenbach, Maximilian Fürst
Publication date: 8 January 2020
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.08365
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
On the semitotal forcing number of a graph ⋮ Bounds on the connected forcing number of a graph ⋮ Zero forcing versus domination in cubic graphs
Cites Work
- Unnamed Item
- Extremal values and bounds for the zero forcing number
- Girth and treewidth
- An upper bound for the minimum rank of a graph
- The Moore bound for irregular graphs
- Some bounds on the zero forcing number of a graph
- Logic circuits from zero forcing
- Zero forcing sets and the minimum rank of graphs
- Nondiscriminatory propagation on trees
- The forcing number of graphs with given girth
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- Bounds for the Zero Forcing Number of Graphs with Large Girth
This page was built for publication: A short proof for a lower bound on the zero forcing number
