Adam Berliner, Cora Brown, Joshua Carlson, Nathanael Cox,
Leslie Hogben, Jason Hu, Katrina Jacobs, Kathryn Manternach,
Travis Peters, Nathan Warnberg and Michael Young
An oriented graph is a simple digraph obtained from a simple graph by choosing exactly one of
the two arcs
or
to replace
each edge
.
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
, for various orientations
and for the doubly
directed digraph of
,
and establish an upper bound on the number of arcs in a simple digraph in terms of
the zero forcing number.
Keywords
zero forcing number, maximum nullity, minimum rank, path
cover number, simple digraph, oriented graph
Department of Mathematics
Iowa State University
Ames, IA 50011
and American Institute of Mathematics
600 East Brokaw Road
San Jose, CA 95112 United States