Zero forcing propagation time on oriented graphs
type: Item
instance of: scholarly article
title: Zero forcing propagation time on oriented graphs
zbMATH Open document ID: 1361.05041
author: Yong-Cai Geng
author: Sumit K. Garg
published in: Discrete Applied Mathematics
publication date: 2017-05-15T00:00:00Z
full work available at URL: https://lib.dr.iastate.edu/math_pubs/56
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6715551
zbMATH Keywords: zero forcing process
zbMATH Keywords: propagation time
zbMATH Keywords: oriented graphs
zbMATH Keywords: Hessenberg path
zbMATH Keywords: throttling
MaRDI profile type: Publication
OpenAlex ID: W2600955787
cites work: Zero forcing sets and the minimum rank of graphs
cites work: Upper bounds on the \(k\)-forcing number of a graph
cites work: On the minimum rank of not necessarily symmetric matrices: A preliminary study
cites work: Path cover number, maximum nullity, and zero forcing number of oriented graphs and other simple digraphs
cites work: Minimum rank, maximum nullity, and zero forcing number of simple digraphs
cites work: Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
cites work: Throttling zero forcing propagation speed on graphs
cites work: Iteration index of a zero forcing set in a graph
cites work: Extremal values and bounds for the zero forcing number
cites work: Minimum rank problems
cites work: Propagation time for zero forcing on a graph
cites work: Fractional zero forcing via three-color forcing games
cites work: Proof of a conjecture on the zero forcing number of a graph
cites work: Q4223159
cites work: Zero forcing number, constrained matchings and strong structural controllability
DOI: 10.1016/J.DAM.2017.02.017
description: scientific article; zbMATH DE number 6715551