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

Abstract

∗Department of Mathematics, Statistics, and Computer Science, St. Olaf College, Northfield, MN 55057 (berliner@stolaf.edu), (coxn@stolaf.edu). Research of N. Cox supported by NSF DMS 0750986 †Department of Mathematics, Carleton College, Northfield, MN 55057 (brownc@carleton.edu). Research supported by NSF DMS 0750986. ‡Department of Mathematics, Iowa State University, Ames, IA 50011 (jmsdg7@iastate.edu), (warnberg@iastate.edu), (myoung@iastate.edu). Research of J. Carlson supported by ISU Holl funds. Research of M. Young supported by NSF DMS 0946431. §Department of Mathematics, Iowa State University, Ames, IA 50011, (lhogben@iastate.edu) and American Institute of Mathematics, 360 Portage Ave, Palo Alto, CA 94306 (hogben@aimath.org). ¶Department of Mathematics, University of California, Berkeley, CA 94720-3840 (jason.hu@berkeley.edu). Research supported by NSF DMS 0750986. ‖Department of Mathematics, Pomona College, 610 North College Avenue, Claremont, CA 91711 (klj02011@mymail.pomona.edu). Research supported by NSF DMS 0750986. ∗∗Department of Mathematics and Computer Science, Central College, Pella, IA 50219 (manternachk1@central.edu). Research supported by ISU Holl funds. ††Natural and Mathematical Science Division, Culver-Stockton College, Canton, MO 63435 (tpeters319@gmail.com).