Extremal values and bounds for the zero forcing number
From MaRDI portal
(Redirected from Publication:317429)
Recommendations
Cites work
- A technique for computing the zero forcing number of a graph with a cut-vertex
- Bounds for the Zero Forcing Number of Graphs with Large Girth
- Iteration index of a zero forcing set in a graph
- On the complexity of the positive semidefinite zero forcing number
- Propagation time for zero forcing on a graph
- Splitting a graph into disjoint induced paths or cycles.
- Upper bounds on the \(k\)-forcing number of a graph
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
- Zero forcing number, constrained matchings and strong structural controllability
- Zero forcing sets and bipartite circulants
- Zero forcing sets and the minimum rank of graphs
Cited in
(51)- Forcing brushes
- 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
- Semitotal forcing in claw-free cubic graphs
- The zero forcing number of graphs with the matching number and the cyclomatic number
- Total forcing versus total domination in cubic graphs
- Propagating sets in Sierpiński fractal graphs
- Some results on the total (zero) forcing number of a graph
- A short proof of Zhou, Wong and Sun's conjecture
- The Zero Forcing Number of Graphs
- Zero forcing versus domination in cubic graphs
- Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph
- Bounds on zero forcing using (upper) total domination and minimum degree
- Open global shadow graph and it’s zero forcing number
- Total forcing sets and zero forcing sets in trees
- An approximation algorithm for zero forcing
- 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
- On zero forcing number of graphs and their complements
- Bounding the total forcing number of graphs
- On the nullity of a connected graph in terms of order and maximum degree
- On a conjecture of \textit{TxGraffiti}: relating zero forcing and vertex covers in graphs
- The zero forcing number of claw-free cubic graphs
- The zero forcing number of expanded paths and cycles
- Zero forcing number and propagation time discrepancy of some graphs
- On graphs maximizing the zero forcing number
- Complexity and computation of connected zero forcing
- On the relationship between the zero forcing number and path cover number for some graphs
- Note on forcing problem of trees
- The forcing number of graphs with given girth
- Minimal zero forcing sets
- Bounds for zero forcing numbers of connected graphs with fixed order and maximum degree
- Some bounds on the zero forcing number of a graph
- Spreading in claw-free cubic graphs
- On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph
- Zero forcing number of a graph in terms of the number of pendant vertices
- Zero forcing in triangulations
- Zero forcing number and maximum nullity of general power graphs
- On extremal graphs for zero forcing number
- On the zero forcing number and spectral radius of graphs
- Zero forcing in benzenoid network
- On the zero forcing number of complementary prism graphs
- On the total forcing number of a graph
- Bounds on the connected forcing number of a graph
- Total forcing and zero forcing in claw-free cubic graphs
- On a conjecture of Gentner and Rautenbach
- Matching, path covers, and total forcing sets
- UPPER BOUNDS ON THE SEMITOTAL FORCING NUMBER OF GRAPHS
- 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)
