Propagation time for zero forcing on a graph
From MaRDI portal
Publication:442213
DOI10.1016/j.dam.2012.04.003zbMath1246.05056arXiv1410.4191OpenAlexW2141046366MaRDI QIDQ442213
Publication date: 10 August 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.4191
Related Items (59)
Throttling for Zero Forcing and Variants ⋮ On the zero forcing number and propagation time of oriented graphs ⋮ Computational approaches for zero forcing and related problems ⋮ Fractional zero forcing via three-color forcing games ⋮ Proof of a conjecture on the zero forcing number of a graph ⋮ Failed skew zero forcing on a graph ⋮ Upper bounds for positive semidefinite propagation time ⋮ Extremal values and bounds for the zero forcing number ⋮ Proper colorings from positive semidefinite zero forcing sets ⋮ Multi-color forcing in graphs ⋮ Throttling for standard zero forcing on directed graphs ⋮ A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs ⋮ Throttling processes equivalent to full throttling on trees ⋮ Total forcing sets and zero forcing sets in trees ⋮ Note on power propagation time and lower bounds for the power domination number ⋮ On tight bounds for the \(k\)-forcing number of a graph ⋮ An integer program for positive semidefinite zero forcing in graphs ⋮ Positive semidefinite propagation time ⋮ Some bounds on the zero forcing number of a graph ⋮ Restricted power domination and zero forcing problems ⋮ Minimum rank and zero forcing number for butterfly networks ⋮ Bounding the total forcing number of graphs ⋮ Unnamed Item ⋮ Infection in hypergraphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Throttling positive semidefinite zero forcing propagation time on graphs ⋮ Probabilistic zero forcing on random graphs ⋮ On the total forcing number of a graph ⋮ Upper bounds on the \(k\)-forcing number of a graph ⋮ Properties of a \(q\)-analogue of zero forcing ⋮ The zero forcing polynomial of a graph ⋮ Bounds on expected propagation time of probabilistic zero forcing ⋮ Grundy dominating sequences and zero forcing sets ⋮ Zero forcing propagation time on oriented graphs ⋮ Total forcing and zero forcing in claw-free cubic graphs ⋮ Propagation time for probabilistic zero forcing ⋮ On the error of \textit{a priori} sampling: zero forcing sets and propagation time ⋮ Total forcing versus total domination in cubic graphs ⋮ Complexity and computation of connected zero forcing ⋮ Zero forcing versus domination in cubic graphs ⋮ Throttling for the game of cops and robbers on graphs ⋮ Algorithms and applications for a class of bilevel MILPs ⋮ 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 ⋮ Matching, path covers, and total forcing sets ⋮ Skew throttling ⋮ Zero forcing in claw-free cubic graphs ⋮ Note on forcing problem of trees ⋮ Product throttling ⋮ Tight bounds on probabilistic zero forcing on hypercubes and grids ⋮ The language of epidemic ⋮ On the relationship between the zero forcing number and path cover number for some graphs ⋮ A computational comparison of compact MILP formulations for the zero forcing number ⋮ On zero forcing number of graphs and their complements ⋮ Power domination throttling ⋮ Edge Forcing in Butterfly Networks ⋮ Using Markov chains to determine expected propagation time for probabilistic zero forcing
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
- Minimum rank problems
- Zero forcing parameters and minimum rank problems
- Zero forcing sets and the minimum rank of graphs
- Iteration Index of a Zero Forcing Set in a Graph
- Nondiscriminatory propagation on trees
This page was built for publication: Propagation time for zero forcing on a graph
