Zero forcing parameters and minimum rank problems
Authors:
- Francesco BarioliFBFrancesco Barioli
- Wayne BarrettWBWayne Barrett
- Shaun M. FallatSFShaun M. Fallat
- H. Tracy HallHHH. Tracy Hall
- Leslie HogbenLHLeslie Hogben
- Bryan ShaderBSBryan Shader
- P. van Den DriesschePDP. van Den Driessche
- Hein van der HolstHHHein van der Holst
- 1 August 2010
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 433 (2) , 401-411
Abstract
No abstract availableKeywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Maximum nullity of outerplanar graphs and the path cover numberLinear Algebra and its Applications, 2010
- Lower Bounds in Minimum Rank ProblemsLinear Algebra and its Applications, 2010
- Linearly independent vertices and minimum semidefinite rankLinear Algebra and its Applications, 2009
- Zero forcing sets and the minimum rank of graphsLinear Algebra and its Applications, 2008
- Full Control by Locally Induced RelaxationPhysical Review Letters, 2007
- Computation of minimal rank and path cover number for certain graphsLinear Algebra and its Applications, 2004
- Graphs whose positive semi-definite matrices have nullity at most twoLinear Algebra and its Applications, 2003
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a treeLinear and Multilinear Algebra, 1999
- Multiplicities of Eigenvalues and Tree-Width of GraphsJournal of Combinatorial Theory, Series B, 1998
- Olga, matrix theory and the Taussky unification problemLinear Algebra and its Applications, 1998