Path cover number, maximum nullity, and zero forcing number of oriented graphs and other simple digraphs

Date
2015-01-01
Authors
Berliner, Adam
Brown, Cora
Hogben, Leslie
Carlson, Joshua
Cox, Nathanael
Hogben, Leslie
Hu, Jason
Jacobs, Katrina
Manternach, Kathryn
Peters, Travis
Warnberg, Nathan
Young, Michael
Journal Title
Journal ISSN
Volume Title
Publisher
Source URI
Altmetrics
Authors
Research Projects
Organizational Units
Mathematics
Organizational Unit
Journal Issue
Series
Abstract

An oriented graph is a simple digraph obtained from a simple graph by choosing exactly one of the two arcs (u,v)(u,v) or (v,u)(v,u) to replace each edge {u,v}{u,v}. A simple digraph describes the zero-nonzero pattern of off-diagonal entries of a family of (not necessarily symmetric) matrices. The 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 and path cover number are related parameters. We establish bounds on the range of possible values of all these parameters for oriented graphs, establish connections between the values of these parameters for a simple graph GG, for various orientations G→G→ and for the doubly directed digraph of GG, and establish an upper bound on the number of arcs in a simple digraph in terms of the zero forcing number.

Description
<p>This is an article from <em>Involve</em> 8 (2015): 147, doi:<a href="http://dx.doi.org/10.2140/involve.2015.8.147" target="_blank">10.2140/involve.2015.8.147</a>. Posted with permission.</p>
Keywords
zero forcing number, maximum nullity, minimum rank, path cover number, simple digraph, oriented graph
Citation
Collections