References
- [1] D. Amos, Y. Caro, R. Davila, R. Pepper, Upper bounds on the k-forcing number of a graph, Discrete Appl. Math., 181 (2015), 1–10.
- [2] D. Burgarth, V. Giovannetti, L. Hogben, S. Severini, M. Young, Logic circuits from zeroforcing, Natural Computing, 14 (2015), 485–490.
- [3] F. Harary, Graph Theory, Addison-Wesely, Massachusethes, (1969).
- [4] R. Ponraj, S. Somasundaram, On the degree splitting graph of a graph, NATL ACAD SCI LETT, 27 (7 & 8) (2004), 275–278.
- [5] Premodkumar, Charles Dominic, Baby Chacko, On the zeroforcing number of graphs and their splitting graphs, Algebra Discrete Math., Accepted, 28 (2019).
- [6] D. D. Row, Zero forcing number: Results for computation and comparison with other graph parameters, Iowa State University, Ames, Iowa (2011).
- [7] D. D. Row, A technique for computing the zero forcing number of a graph with a cut vertex, Linear Algebra Appl., 436 (2012), 4423–4432.
- [8] E. Sampathkumar, H. B. Walikaer, On the splitting graph of a graph, Journal of Karnatak University Science, 25 (1981), 13–16.
- [9] F. A. Taklimi, Zeroforcing sets for graphs, arXiv:1311.7672, (2013).
- [10] Hatice Topcu, Sezer Sorgun, Willem H. Haemers, On the spectral characterization of pineapple graphs, arXiv:1511.08674v3 [math.CO] 10 June 2016.
- [11] Hein van der Holst et al., Zero forcing sets and the minimum rank of graphs, Linear Algebra Appl., 428 (2008), 1628–1648,.
- [12] Xiaolin Zhang, Heping Zhang, Some graphs determined by their spectra, Linear Algebra Appl, 431 (2009), 1443–1454.
- [13] https://aimath.org/pastworkshops/catalog2.html