Abstract
Zero forcing is a combinatorial game played on a graph where the goal is to start with all vertices unfilled and to change them to filled at minimal cost. In the original variation of the game there were two options. Namely, to fill any one single vertex at the cost of a single token; or if any currently filled vertex has a unique non-filled neighbor, then the neighbor is filled for free. This paper investigates a q-analogue of zero forcing which introduces a third option involving an oracle. Basic properties of this game are established including determining all graphs which have minimal cost 1 or 2 for all possible q, and finding the zero forcing number for all trees when \(q=1\).
Similar content being viewed by others
Change history
24 August 2020
A Correction to this paper has been published: https://doi.org/10.1007/s00373-020-02219-z
Notes
In terms of the linear algebraic philosophy of zero forcing, tokens were spent to probe and get additional information about the possible structure of the null space of a matrix and using the information to obtain a better bound on the nullity.
References
AIM minimum rank-special graphs work group: Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl. 428, 1628–1648 (2008)
Barioloi, F., Barret, 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)
Butler, S., Grout, J., Hall, H.T.: Using variants of zero forcing to bound the inertia set of a graph. Electron. J. Linear Algebra 30, 1–18 (2015)
Ekstrand, J., Erickson, C., Hall, H.T., Hay, D., Hogben, L., Johnson, R., Kingsley, N., Osborne, S., Peters, T., Roat, J., Ross, A., Row, D., Warnberg, N., Young, M.: Positive semidefinite zero forcing number. Linear Algebra Appl. 439, 1862–1874 (2013)
Fallat, S., Hogben, L.: Minimum rank, maximum nullity, and zero forcing number of graphs. In: Hogben, L. (ed.) Handbook of Linear Algebra, 2nd edn. CRC Press, Boca Raton (2014)
Hogben, L., Huynh, M., Kingsley, N., Meyer, S., Walker, S., Young, M.: Propagation time for zero forcing on a graph. Discrete Appl. Math. 160, 1994–2005 (2012)
Row, Darren D.: A technique for computing the zero forcing number of a graph with a cut-vertex. Linear Algebra Appl. 436, 4423–4432 (2012)
Yang, Boting: Fast-mixed searching and related problems on graphs. Theor. Comput. Sci. 507(7), 100–113 (2013)
Acknowledgements
The genesis of this paper was from the American Institute of Mathematics workshop Zero forcing and its applications, held in January 2017. We thank AIM for hosting their workshop and their support in bringing us together. Steve Butler was partially supported by a grant from the Simons Foundation (#427264). Shaun Fallat’s research is supported in part by an NSERC Discovery Research Grant, Application No.: RGPIN-2014-06036. Jephian C.-H. Lin was partially supported from the Young Scholar Fellowship Program by the Ministry of Science and Technology (MOST) in Taiwan, under Grant MOST108-2636-M-110-001. Boting Yang’s research is supported in part by an NSERC Discovery Research Grant, Application No.: RGPIN-2018-06800.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
The original version of this article was revised: The LaTeX control sequence \deg is interpreted differently in the authors' and the publisher’s LaTeX setting. The authors’ intention is deg, as the degree of a vertex on a graph; however, it becomes a circle, as the degree for temperature, in the publisher’s environment. As a consequence, the mistakes occur whenever the macro \deg is used.
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
Butler, S., Erickson, C., Fallat, S. et al. Properties of a q-Analogue of Zero Forcing. Graphs and Combinatorics 36, 1401–1419 (2020). https://doi.org/10.1007/s00373-020-02208-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-020-02208-2