Effects of vertex degrees on the zero-forcing number and propagation time of a graph
From MaRDI portal
Publication:1801062
DOI10.1016/j.dam.2018.05.002zbMath1398.05085OpenAlexW2806089726WikidataQ129743049 ScholiaQ129743049MaRDI QIDQ1801062
Publication date: 26 October 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.05.002
Related Items (9)
Computational approaches for zero forcing and related problems ⋮ On the zero blocking number of rectangular, cylindrical, and Möbius grids ⋮ Immune sets in monotone infection rules. Characterization and complexity ⋮ An integer program for positive semidefinite zero forcing in graphs ⋮ The strong spectral property of graphs: graph operations and barbell partitions ⋮ Blocking zero forcing processes in Cartesian products of graphs ⋮ Unnamed Item ⋮ Uniform forcing and immune sets in graphs and hypergraphs ⋮ Power domination throttling
Cites Work
- Unnamed Item
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
- Propagation time for zero forcing on a graph
- Positive semidefinite propagation time
- On minimum rank and zero forcing sets of a graph
- Zero forcing parameters and minimum rank problems
- Graph minors. X: Obstructions to tree-decomposition
- Local controllability of quantum systems
- On the relationships between zero forcing numbers and certain graph coverings
- Zero forcing sets and the minimum rank of graphs
- Iteration Index of a Zero Forcing Set in a Graph
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- Probabilistic Zero Forcing in Graphs
This page was built for publication: Effects of vertex degrees on the zero-forcing number and propagation time of a graph