On graphs maximizing the zero forcing number
From MaRDI portal
Publication:6157420
DOI10.1016/J.DAM.2023.03.011zbMATH Open1512.05231MaRDI QIDQ6157420FDOQ6157420
Authors: Yi-Ping Liang, S. J. Xu
Publication date: 11 May 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Zero forcing sets and the minimum rank of graphs
- Parameters related to tree-width, zero forcing, and maximum nullity of a graph
- Some bounds on the zero forcing number of a graph
- Proof of a conjecture on the zero forcing number of a graph
- Extremal values and bounds for the zero forcing number
- A technique for computing the zero forcing number of a graph with a cut-vertex
- Upper bounds on the \(k\)-forcing number of a graph
- Bounds for the Zero Forcing Number of Graphs with Large Girth
- Dynamic approach to k-forcing
- On the complexity of the positive semidefinite zero forcing number
- Fast-mixed searching and related problems on graphs
- A Graph Reduction Step Preserving Element-Connectivity and Applications
- Logic circuits from zero forcing
- A lower bound on the zero forcing number
- The relationship between \(k\)-forcing and \(k\)-power domination
- On the zero forcing number of a graph involving some classical parameters
- Zero forcing number of a graph in terms of the number of pendant vertices
Cited In (21)
- Forcing brushes
- Extremal \(k\)-forcing sets in oriented graphs
- The zero forcing number of graphs with the matching number and the cyclomatic number
- On Zero Forcing Number of Permutation Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Zero Forcing Number of Graphs
- Bounds on zero forcing using (upper) total domination and minimum degree
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
- Bounds for the Zero Forcing Number of Graphs with Large Girth
- Proof of a conjecture on the zero forcing number of a graph
- Extremal values and bounds for the zero forcing number
- Three-state zero forcing on graphs
- Zero forcing number, constrained matchings and strong structural controllability
- Probabilistic Zero Forcing on Grid, Regular, and Hypercube Graphs
- Some bounds on the zero forcing number of a graph
- Title not available (Why is that?)
- On extremal graphs for zero forcing number
- Zero-forcing in random regular graphs
- UPPER BOUNDS ON THE SEMITOTAL FORCING NUMBER OF GRAPHS
- Reconfiguration graphs of zero forcing sets
This page was built for publication: On graphs maximizing the zero forcing number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157420)