Minimum Rank , Maximum Nullity , and Zero Forcing Number of Simple Digraphs

@inproceedings{Berliner2012MinimumR,
  title={Minimum Rank , Maximum Nullity , and Zero Forcing Number of Simple Digraphs},
  author={Adam Berliner and Minerva Catral and Leslie Hogben and My Huynh and KELSEY LIED},
  year={2012}
}
A simple digraph describes the off-diagonal zero-nonzero pattern of a family of (not necessarily symmetric) matrices. Minimum rank of a simple digraph is the minimum rank of this family of matrices; maximum nullity is defined analogously. The simple digraph zero forcing number is an upper bound for maximum nullity. Cut-vertex reduction formulas for minimum rank and zero forcing number for simple digraphs are established. The effect of deletion of a vertex on minimum rank or zero forcing number… CONTINUE READING