1. E. Ackerman, O. Ben-Zwi, and G. Wolfovitz, Combinatorial model and bounds for target set selection, Theoret. Comput. Sci., 411 (2010), 4017–4022.
2. S. S. Adams, Z. Brass, C. Stokes, and D. S. Troxell, Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products, Australas. J. Combin., 56 (2013), 47–60.
3. S. S. Adams, D. S. Troxell, and S. L. Zinnen, Dynamic monopolies and feedback vertex sets in hexagonal grids, Comput. Math. Appl., 62 (2011), 4049–4057.
4. S. Bao and L. W. Beineke, The decycling number of graphs, Australas. J. Combin., 25 (2002), 285–298.
5. O. Ben-Zwi, D. Hermelin, and D. Lokshtanov, An exact almost optimal algorithm for target set selection in social networks, Proceedings of the tenth ACM conference on Electronic commerce, 2009, Stanford, CA, USA.