Path cover number, maximum nullity, and zero forcing number of oriented graphs and other simple digraphs
Path cover number, maximum nullity, and zero forcing number of oriented graphs and other simple digraphs
复制标题
有向图和其他简单有向图的路径覆盖数、最大无效性和迫零数
DOI:
10.2140/involve.2015.8.147
复制
发表时间:
2015
期刊:
影响因子:
--
通讯作者:
Michael Young
中科院分区:
文献类型:
--
作者:
Adam H. Berliner;Cora Brown;Joshua Carlson;Nathanael Cox;L. Hogben;Jason Hu;Katrina Jacobs;Kathryn Manternach;Travis Peters;Nathan Warnberg;Michael Young
∗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).