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.)
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
