On minimum rank and zero forcing sets of a graph
Authors:
- Liang-Hao HuangLHLiang-Hao Huang
- Gerard J. ChangGCGerard J. Chang
- Hong-Gwa YehHYHong-Gwa Yeh
- 1 June 2010
- journal article
- research article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 432 (11) , 2961-2973
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- The inverse inertia problem for graphs: Cut vertices, trees, and a counterexampleLinear Algebra and its Applications, 2009
- On acyclic and unicyclic graphs whose minimum rank equals the diameterLinear Algebra and its Applications, 2008
- An upper bound for the minimum rank of a graphLinear Algebra and its Applications, 2008
- Three-connected graphs whose maximum nullity is at most threeLinear Algebra and its Applications, 2008
- Orthogonal representations, minimum rank, and graph complementsLinear Algebra and its Applications, 2008
- The maximum corank of graphs with a 2-separationLinear Algebra and its Applications, 2008
- Zero forcing sets and the minimum rank of graphsLinear Algebra and its Applications, 2008
- Computation of minimal rank and path cover number for certain graphsLinear Algebra and its Applications, 2004
- Inverse eigenvalue problems for Jacobi matricesLinear Algebra and its Applications, 1976
- On the compatibility between a graph and a simple orderJournal of Combinatorial Theory, Series B, 1971