Iteration Index of a Zero Forcing Set in a Graph
From MaRDI portal
Publication:2910019
zbMath1251.05149arXiv1105.1492MaRDI QIDQ2910019
Cong X. Kang, Eunjeong Yi, Nathaniel Dean, Kiran B. Chilakamarri
Publication date: 7 September 2012
Full work available at URL: https://arxiv.org/abs/1105.1492
Cartesian product of graphszero forcing numberzero forcing setbouquet of circlesiteration index of a zero forcing set
Applications of graph theory (05C90) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)
Related Items
On the zero forcing number and propagation time of oriented graphs, Computational approaches for zero forcing and related problems, Upper bounds for positive semidefinite propagation time, Extremal values and bounds for the zero forcing number, Multi-color forcing in graphs, A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs, Extremal \(k\)-forcing sets in oriented graphs, On tight bounds for the \(k\)-forcing number of a graph, Positive semidefinite propagation time, Some bounds on the zero forcing number of a graph, The zero forcing number of graphs with the matching number and the cyclomatic number, Infection in hypergraphs, Propagation time for zero forcing on a graph, Unnamed Item, Upper bounds on the \(k\)-forcing number of a graph, Bounds on expected propagation time of probabilistic zero forcing, Zero forcing propagation time on oriented graphs, Propagation time for probabilistic zero forcing, Effects of vertex degrees on the zero-forcing number and propagation time of a graph, Connected zero forcing sets and connected propagation time of graphs, Zero forcing number of a graph in terms of the number of pendant vertices, Note on forcing problem of trees, Using Markov chains to determine expected propagation time for probabilistic zero forcing
