[
[1] AIM Minimum Rank–Special Graphs Work Group, Zero forcing sets and the minimum rank of graphs, Linear Algebra and its Applications 428, 7 (2008) 1628–1648. ⇒139, 15110.1016/j.laa.2007.10.009
]Search in Google Scholar
[
[2] F. Alinaghipour Taklimi, Zero forcing sets for graphs, PhD thesis, The University of Regina (2013). ⇒152
]Search in Google Scholar
[
[3] D. Amos, Y. Caro, R. Davila, R. Pepper, Upper bounds on the k-forcing number of a graph, Discrete Applied Mathematics, 181, (2015) 1–10. ⇒14410.1016/j.dam.2014.08.029
]Search in Google Scholar
[
[4] F. Barioli, W. Barrett, S. M. Fallat, H. T. Hall, L. Hogben, B. Shader, P. van den Driessche, H. Van Der Holst, Parameters related to tree-width, zero forcing, and maximum nullity of a graph, Journal of Graph Theory, 72, 2 (2013) 146–177. ⇒13910.1002/jgt.21637
]Search in Google Scholar
[
[5] A. Berman, S. Friedland, L. Hogben, U. G. Rothblum, B. Shader, An upper bound for the minimum rank of a graph, Linear Algebra and its Applications, 429, 7 (2008) 1629–1638. ⇒14310.1016/j.laa.2008.04.038
]Search in Google Scholar
[
[6] D. Burgarth, V. Giovannetti, Full control by locally induced, Physical Review Letters, 99, 10 (2007) 100501. ⇒13910.1103/PhysRevLett.99.10050117930379
]Search in Google Scholar
[
[7] D. Burgarth, V. Giovannetti, L. Hogben, S. Severini, M. Young, Logic circuits from zero forcing, Natural computing 14, 3 (2015) 485–490. ⇒13910.1007/s11047-014-9438-5454171026300713
]Search in Google Scholar
[
[8] B. Chacko, C. Dominic, K. Premodkumar, On the zero forcing number of graphs and their splitting graphs, Algebra and Discrete Mathematics, 28, 1 (2009) 29–43. ⇒139
]Search in Google Scholar
[
[9] R. Davila, M. A. Henning, ero forcing in claw-free cubic graphs, Bulletin of the Malaysian Mathematical Sciences Society, 43, 1 (2020) 673–688. ⇒13910.1007/s40840-018-00705-5
]Search in Google Scholar
[
[10] G. A. Dirac, Some theorems on abstract graphs, Proceedings of the London Mathematical Society, 3, 1 (1952) 69–81. ⇒14210.1112/plms/s3-2.1.69
]Search in Google Scholar
[
[11] C. Dominic, Zero forcing number of degree splitting graphs and complete degree splitting graphs, Acta Universitatis Sapientiae Mathematica, 11, 1 (2019) 40–53. ⇒13910.2478/ausm-2019-0004
]Search in Google Scholar
[
[12] T. W. Haynes, S. M. Hedetniemi, S. T. Hedetniemi, M. A. Henning, Domination in graphs applied to electric power networks, SIAM Journal on Discrete Mathematics, 15, 4 (2002) 519–529. ⇒13910.1137/S0895480100375831
]Search in Google Scholar
[
[13] L. S. Mays, The Zero Forcing Number Of GraphsBipartite, (2013). ⇒139, 145
]Search in Google Scholar
[
[14] M. R. Raksha, C. Dominic, Open global shadow graph and it’s zero forcing number (2022) Communicated. ⇒138
]Search in Google Scholar
[
[15] J. Salvatore, Bipartite graphs and problem solving, University of Chicago, 2007, pp. 8. ⇒141
]Search in Google Scholar
[
[16] M. Trefois, J. C. Delvenne, Zero forcing number, constrained matchings and strong structural controllability, Linear Algebra and its Applications, 484, 1 (2015) 199–218. ⇒13910.1016/j.laa.2015.06.025
]Search in Google Scholar
[
[17] S. Vaidya, B. Lekha, New families of odd gracefull graphs International Journal of Open Problems in Computer Science and, Mathematics. 3, 5 (2010). ⇒138
]Search in Google Scholar
[
[18] D. B. West, Introduction to Graph Theory. vol 2., Prentice Hall, Upper Saddle River, 2001. ⇒139
]Search in Google Scholar
[
[19] M. Zhao, L. Kang, G. J. Chang, Power domination in graphs, Discrete Mathematics, 306, 15 (2006) 1812–1816. ⇒13910.1016/j.disc.2006.03.037
]Search in Google Scholar
