Extremal values and bounds for the zero forcing number
DOI10.1016/J.DAM.2016.06.004zbMATH Open1346.05068OpenAlexW2470750180MaRDI QIDQ317429FDOQ317429
Uéverton S. Souza, Lucia Draque Penso, Michael Gentner, Dieter Rautenbach
Publication date: 30 September 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.06.004
Recommendations
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Zero forcing sets and the minimum rank of graphs
- Splitting a graph into disjoint induced paths or cycles.
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
- Iteration index of a zero forcing set in 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
- Bounds for the Zero Forcing Number of Graphs with Large Girth
- On the complexity of the positive semidefinite zero forcing number
- Zero forcing sets and bipartite circulants
Cited In (34)
- On the zero forcing number of a graph involving some classical parameters
- A lower bound on the zero forcing number
- Grundy domination and zero forcing in regular graphs
- The zero forcing number of graphs with the matching number and the cyclomatic number
- Total forcing versus total domination in cubic graphs
- The Zero Forcing Number of Graphs
- A short proof of Zhou, Wong and Sun's conjecture
- Zero forcing versus domination in cubic graphs
- Bounds on zero forcing using (upper) total domination and minimum degree
- Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph
- Open global shadow graph and it’s zero forcing number
- Total forcing sets and zero forcing sets in trees
- Zero forcing in claw-free cubic graphs
- A short proof for a lower bound on the zero forcing number
- On trees and unicyclic graphs with equal forcing-type numbers
- Bounding the total forcing number of graphs
- Zero forcing in Benzenoid network
- On a conjecture of \textit{TxGraffiti}: relating zero forcing and vertex covers in graphs
- The zero forcing number of claw-free cubic graphs
- On the nullity of a connected graph in terms of order and maximum degree
- On graphs maximizing the zero forcing number
- Complexity and computation of connected zero forcing
- The forcing number of graphs with given girth
- Note on forcing problem of trees
- Some bounds on the zero forcing number of a graph
- On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph
- On extremal graphs for zero forcing number
- On the zero forcing number and spectral radius of graphs
- On the total forcing number of a graph
- Total forcing and zero forcing in claw-free cubic graphs
- Matching, path covers, and total forcing sets
- UPPER BOUNDS ON THE SEMITOTAL FORCING NUMBER OF GRAPHS
- On a conjecture of Gentner and Rautenbach
- Zero forcing propagation time on oriented graphs
This page was built for publication: Extremal values and bounds for the zero forcing number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q317429)
