Vol. 4, No. 3, 2011
Download this article
Download this article For screen
For printing
Recent Issues

Volume 18
Issue 3, 387–566
Issue 2, 181–385
Issue 1, 1–180

Volume 17, 5 issues

Volume 16, 5 issues

Volume 15, 5 issues

Volume 14, 5 issues

Volume 13, 5 issues

Volume 12, 8 issues

Volume 11, 5 issues

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
Editors' interests
 
Subscriptions
 
ISSN 1944-4184 (online)
ISSN 1944-4176 (print)
 
Author index
To appear
 
Other MSP journals
Zero forcing number, path cover number, and maximum nullity of cacti

Darren D. Row

Vol. 4 (2011), No. 3, 277–291
DOI: 10.2140/involve.2011.4.277
Abstract

The zero forcing number of a graph is the minimum size of a zero forcing set. This parameter is useful in the minimum rank/maximum nullity problem, as it gives an upper bound to the maximum nullity. The path cover number of a graph is the minimum size of a path cover. Results for comparing the parameters are presented, with equality of zero forcing number and path cover number shown for all cacti and equality of zero forcing number and maximum nullity for a subset of cacti. (A cactus is a graph where each edge is in at most one cycle.)

Keywords
zero forcing number, path cover number, maximum nullity, cut-edge, cut-vertex, cactus
Mathematical Subject Classification 2010
Primary: 05C50
Secondary: 15A03
Milestones
Received: 5 May 2011
Revised: 12 May 2011
Accepted: 13 May 2011
Published: 13 March 2012

Communicated by Chi-Kwong Li
Authors
Darren D. Row
Division of Science and Mathematics
Upper Iowa University
Fayette, IA 52142
United States