Extremal values and bounds for the zero forcing number
From MaRDI portal
Publication:317429
DOI10.1016/j.dam.2016.06.004zbMath1346.05068OpenAlexW2470750180MaRDI QIDQ317429
Uéverton S. Souza, Michael Gentner, Dieter Rautenbach, Lucia Draque Penso
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
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (31)
On the zero forcing number and spectral radius of graphs ⋮ Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph ⋮ On trees and unicyclic graphs with equal forcing-type numbers ⋮ A short proof of Zhou, Wong and Sun's conjecture ⋮ Total forcing sets and zero forcing sets in trees ⋮ On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph ⋮ Some bounds on the zero forcing number of a graph ⋮ UPPER BOUNDS ON THE SEMITOTAL FORCING NUMBER OF GRAPHS ⋮ On graphs maximizing the zero forcing number ⋮ Open global shadow graph and it’s zero forcing number ⋮ The zero forcing number of graphs with the matching number and the cyclomatic number ⋮ Bounding the total forcing number of graphs ⋮ On a conjecture of Gentner and Rautenbach ⋮ The Zero Forcing Number of Graphs ⋮ On the total forcing number of a graph ⋮ Zero forcing in Benzenoid network ⋮ 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 ⋮ Zero forcing propagation time on oriented graphs ⋮ Total forcing and zero forcing in claw-free cubic graphs ⋮ Total forcing versus total domination in cubic graphs ⋮ Complexity and computation of connected zero forcing ⋮ 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 ⋮ Zero forcing in claw-free cubic graphs ⋮ Note on forcing problem of trees ⋮ On extremal graphs for zero forcing number
Cites Work
- 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
- Zero forcing sets and bipartite circulants
- Splitting a graph into disjoint induced paths or cycles.
- Zero forcing sets and the minimum rank of graphs
- Iteration Index of a Zero Forcing Set in a Graph
- Bounds for the Zero Forcing Number of Graphs with Large Girth
- On the complexity of the positive semidefinite zero forcing number
This page was built for publication: Extremal values and bounds for the zero forcing number
