Some bounds on the zero forcing number of a graph

DOI10.1016/j.dam.2017.11.015zbMath1377.05058arXiv1608.00747OpenAlexW2964299423MaRDI QIDQ1693145

Dieter Rautenbach, Michael Gentner

Publication date: 11 January 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.00747

zbMATH Keywords

zero forcing number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (29)

On the zero forcing number and spectral radius of graphs ⋮ A short proof of Zhou, Wong and Sun's conjecture ⋮ Total forcing sets and zero forcing sets in trees ⋮ On the zero blocking number of rectangular, cylindrical, and Möbius grids ⋮ On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph ⋮ On graphs maximizing the zero forcing number ⋮ Blocking zero forcing processes in Cartesian products of graphs ⋮ The zero forcing number of graphs with the matching number and the cyclomatic number ⋮ Bounding the total forcing number of graphs ⋮ The Zero Forcing Number of Graphs ⋮ From the editor-in-chief ⋮ On the total forcing number of a graph ⋮ The forcing number of graphs with given girth ⋮ Grundy domination and zero forcing in regular graphs ⋮ On the nullity of a connected graph in terms of order and maximum degree ⋮ Brushing number and zero-forcing number of graphs and their line graphs ⋮ Total forcing and zero forcing in claw-free cubic graphs ⋮ Total forcing versus total domination in cubic graphs ⋮ Zero forcing versus domination in cubic graphs ⋮ A short proof for a lower bound on the zero forcing number ⋮ On the zero forcing number of a graph involving some classical parameters ⋮ A lower bound on the zero forcing number ⋮ Matching, path covers, and total forcing sets ⋮ Grundy domination and zero forcing in Kneser graphs ⋮ Zero forcing in claw-free cubic graphs ⋮ Note on forcing problem of trees ⋮ Maximum nullity and zero forcing number on graphs with maximum degree at most three ⋮ A computational comparison of compact MILP formulations for the zero forcing number ⋮ On extremal graphs for zero forcing number

Cites Work

• Proof of a conjecture on the zero forcing number of a graph
• Extremal values and bounds for the zero forcing number
• Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
• A technique for computing the zero forcing number of a graph with a cut-vertex
• Propagation time for zero forcing on a graph
• Upper bounds on the \(k\)-forcing number of a graph
• Zero forcing number, constrained matchings and strong structural controllability
• Girth and treewidth
• Zero forcing sets and bipartite circulants
• Forbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\)
• Logic circuits from zero forcing
• Zero forcing sets and the minimum rank of graphs
• Iteration Index of a Zero Forcing Set in a Graph
• Nondiscriminatory propagation on trees
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
• On the complexity of the positive semidefinite zero forcing number

This page was built for publication: Some bounds on the zero forcing number of a graph