Zero forcing propagation time on oriented graphs
Authors:
- Adam BerlinerABAdam Berliner
- Chassidy BozemanCBChassidy Bozeman
- Steve ButlerSBSteve Butler
- Minerva CatralMCMinerva Catral
- Leslie HogbenLHLeslie Hogben
- Brenda KroschelBKBrenda Kroschel
- Jephian C.-H. LinJLJephian C.-H. Lin
- Nathan WarnbergNWNathan Warnberg
- Michael YoungMYMichael Young
- 1 June 2017
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 224, 45-59
Abstract
No abstract availableKeywords
Funding Information
- NSF DMS (0946431)
This publication has 13 references indexed in Scilit:
- Extremal values and bounds for the zero forcing numberDiscrete Applied Mathematics, 2016
- Path cover number, maximum nullity, and zero forcing number of oriented graphs and other simple digraphsInvolve, a Journal of Mathematics, 2015
- Upper bounds on the-forcing number of a graphDiscrete Applied Mathematics, 2015
- Zero Forcing, Linear and Quantum Controllability for Systems Evolving on NetworksIEEE Transactions on Automatic Control, 2013
- Minimum rank, maximum nullity, and zero forcing number of simple digraphsThe Electronic Journal of Linear Algebra, 2013
- Propagation time for zero forcing on a graphDiscrete Applied Mathematics, 2012
- Minimum rank problemsLinear Algebra and its Applications, 2010
- On the minimum rank of not necessarily symmetric matrices: A preliminary studyThe Electronic Journal of Linear Algebra, 2009
- Zero forcing sets and the minimum rank of graphsLinear Algebra and its Applications, 2008
- Full Control by Locally Induced RelaxationPhysical Review Letters, 2007