Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{185227,
        author = {Seema Varghese},
        title = {Zero Forcing Problem- A Survey},
        journal = {International Journal of Innovative Research in Technology},
        year = {2025},
        volume = {12},
        number = {5},
        pages = {444-447},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=185227},
        abstract = {The zero forcing problem is a graph-theoretic process that arose from linear algebraic motivations, namely in limiting the maximum nullity of matrices connected with graphs. It has now grown into a substantial research area, with applications including quantum controllability, network monitoring, and combinatorial optimisation. This paper provides an overview of the zero forcing problem, including definitions, key results with proofs, computational complexity, and applications, as well as a discussion of current research objectives.},
        keywords = {Zero Forcing Set, Zero Forcing Number.},
        month = {October},
        }