Skip to main content

On the Relationship Between the Zero Forcing Number and Path Cover Number for Some Graphs

Abstract

The zero forcing number of a graph is the minimum size of a zero forcing set. This parameter bounds the path cover number which is the minimum number of vertex-disjoint-induced paths that cover all the vertices of graph. In this paper, we investigate these two parameters and present an infinite number of graphs with the large difference between these two parameters and an infinite number of graphs with no difference between these parameters. Also, we prove a conjecture about the relationship between these parameters for some graphs.

This is a preview of subscription content, access via your institution.

Fig. 1
Fig. 2

References

  1. Alinaghipour, F.: Zero Forcing Sets for Graphs. Ph.D. thesis, University of Regina (2013)

  2. Alinaghipour, F., Fallat, S., Meagher, K.: On the relationships between zero forcing numbers and certain graph coverings. Spec. Matrices 2(1), 30–45 (2014)

    MathSciNet  MATH  Google Scholar 

  3. Barioli, F., Barrett, W., Fallat, S.M., Hall, T.H., Hogben, L., Shader, B., Van Den Driessche, P., Van Der Holst, H.: Zero forcing parameters and minimum rank problems. Linear Algebra Appl. 433(2), 401–411 (2010)

    MathSciNet  Article  Google Scholar 

  4. Burgarth, D., Giovannetti, V.: Full control by locally induced relaxation. Phys. Rev. Lett. 99(10), 100–501 (2007)

    Article  Google Scholar 

  5. Hogben, L., Kingsley, N., Meyer, S., Walker, S., Young, M.: Propagation time for zero forcing on a graph. Discrete Appl. Math. 160(13), 1994–2005 (2012)

    MathSciNet  Article  Google Scholar 

  6. Johnson, C.R., Duarte, A.L.: The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree. Linear Multilinear Algebra 46(1–2), 139–144 (1999)

    MathSciNet  Article  Google Scholar 

  7. Montazeri, Z., Soltankhah, N.: Zero forcing number for Cartesian product of some graphs. ARS Combin. (to appear)

  8. Row, D.D.: A technique for computing the zero forcing number of a graph with a cut-vertex. Linear Algebra Appl. 436(12), 4423–4432 (2012)

    MathSciNet  Article  Google Scholar 

  9. West, D.B.: Introduction to Graph Theory, vol. 2. Prentice Hall, Upper Saddle River (2001)

  10. AIM Minimum Rank-Special Graphs Work Group: Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl. 428(7), 1628–1648 (2008)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nasrin Soltankhah.

Additional information

Communicated by Hamid Reza Ebrahimi Vishki.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Montazeri, Z., Soltankhah, N. On the Relationship Between the Zero Forcing Number and Path Cover Number for Some Graphs. Bull. Iran. Math. Soc. 46, 767–776 (2020). https://doi.org/10.1007/s41980-019-00290-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s41980-019-00290-8

Keywords

  • Zero forcing number
  • Path cover number
  • Rook’s graph

Mathematics Subject Classification

  • 05C70
  • 05C75
  • 05C76