Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
Authors:
- Christina J. EdholmCEChristina J. Edholm
- Leslie HogbenLHLeslie Hogben
- My HuynhMHMy Huynh
- Joshua LaGrangeJLJoshua LaGrange
- Darren D. RowDRDarren D. Row
- 1 June 2012
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 436 (12) , 4352-4372
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Zero forcing parameters and minimum rank problemsLinear Algebra and its Applications, 2010
- Techniques for determining the minimum rank of a small graphLinear Algebra and its Applications, 2010
- On minimum rank and zero forcing sets of a graphLinear Algebra and its Applications, 2010
- Maximum nullity of outerplanar graphs and the path cover numberLinear Algebra and its Applications, 2010
- Minimum rank problemsLinear Algebra and its Applications, 2010
- 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
- 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
- Minimum-rank matrices with prescribed graphLinear Algebra and its Applications, 1996