Abstract
For a graph \(G=(V,E)\) and an assignment of black and white colors to its vertices, the zero forcing color-change rule operates as follows: if a vertex u and all of its neighbors except v are black, then v is forced to change its color to black. A proper subset S of V is called a zero forcing set if by initially assigning the black vertices to be the elements of S and repeatedly applying this rule to G, all vertices are eventually forced to change their colors to black. Otherwise, S is called a failed zero forcing set. The maximum size of a failed zero forcing set of G is called the failed zero forcing number of G and is denoted by F(G). In this paper, we study the failed zero forcing numbers of three graph families: Kneser graphs K(n, r), Johnson graphs J(n, r), and hypercube graphs \(Q_n\) . Specifically, we prove that \(F(K(n, r))=\left( {\begin{array}{c}n\\ r\end{array}}\right) -(r+2)\), for \(2\le r \le \frac{n-1}{2}\), \(F(J(n, r))=\left( {\begin{array}{c}n\\ r\end{array}}\right) -(r+1)\), for \(1\le r \le \frac{n}{2}\), and \(F(Q_n)=2^n - n\), for \(n \ge 2\) .
Similar content being viewed by others
Notes
American Institute of Mathematics.
References
AIM Minimum Rank-Special Graphs Work Group: Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl. 428, 1628–1648 (2008)
Fallat, S.M., Hogben, L.: Minimum rank, maximum nullity, and zero forcing number of graphs. In: Hogben, L. (ed.) Handbook of Linear Algebra, 2nd edn., pp. 1–46. CRC Press, Boca Raton, FL (2014)
Barioli, F., Barrett, W., Fallat, S.M., Hall, H.T., Hogben, L., Shader, B., van den Driessche, P., van der Holst, H.: Zero forcing parameters and minimum rank problems. Linear Algebra Appl. 433, 401–411 (2010)
Fallat, S.M., Hogben, L.: The minimum rank of symmetric matrices described by a graph: a survey. Linear Algebra Appl. 426, 558–582 (2007)
Fetcie, K., Jacob, B., Saavedra, D.: The failed zero forcing number of a graph. Involve 8, 99–117 (2015)
Shitov, Y.: On the complexity of failed zero forcing. Theor. Comput. Sci. 660, 102–104 (2017)
Gomez, L., Rubi, K., Terrazas, J., Narayan, D.A.: All graphs with a failed zero forcing number of two. Symmetry 13, 2221 (2021)
Swanson, N., Ufferman, E.: A lower bound on the failed zero forcing number of a graph. Involve 16, 493–504 (2023)
Allan, P., Pelayo, B., Nerissa, Ma., Abara, M.: Maximal failed zero forcing sets for products of two graphs (2022). arXiv:2202.04997
Allan, P., Pelayo, B., Nerissa, Ma., Abara, M.: Minimum rank and failed zero forcing number of graphs (2022). arXiv:2202.04993
Acknowledgements
The authors express their appreciation to the anonymous referees for their thorough examination of the manuscript and for helping streamline certain proofs.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflicts of Interest
Not Applicable.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Afzali, F., Ghodrati, A.H. & Maimani, H.R. Failed zero forcing numbers of Kneser graphs, Johnson graphs, and hypercubes. J. Appl. Math. Comput. (2024). https://doi.org/10.1007/s12190-024-02064-w
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s12190-024-02064-w