A technique for computing the zero forcing number of a graph with a cut-vertex
Author:
- Darren D. RowDRDarren D. Row
- 1 June 2012
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 436 (12) , 4423-4432
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Zero forcing parameters and minimum rank problemsLinear Algebra and its Applications, 2010
- On minimum rank and zero forcing sets of a graphLinear Algebra and its Applications, 2010
- Minimum rank problemsLinear Algebra and its Applications, 2010
- The graphs for which the maximum multiplicity of an eigenvalue is twoLinear and Multilinear Algebra, 2009
- On the minimum rank of not necessarily symmetric matrices: A preliminary studyThe Electronic Journal of Linear Algebra, 2009
- Nondiscriminatory propagation on treesJournal of Physics A: Mathematical and Theoretical, 2008
- Zero forcing sets and the minimum rank of graphsLinear Algebra and its Applications, 2008
- The minimum rank of symmetric matrices described by a graph: A surveyLinear Algebra and its Applications, 2007
- Full Control by Locally Induced RelaxationPhysical Review Letters, 2007
- On the difference between the maximum multiplicity and path cover number for tree-like graphsLinear Algebra and its Applications, 2004