1. K. Ameenal Bibi, A. Lakshmi and R. Jothilakshmi, (2017), An Algorithm for Minimal and Minimum distance - 2 dominating sets of Graph, Global Journal of pure and applied Mathematics, ISSN -0978-1768 vol.13, No.2, pp. 1117–1126.
2. E.J. Cockayne, S.T. Hedetniemi, (1977) “Towards a Theory of Domination in Graphs”, Networks, 7, pp. 247–261.
3. T.H. Cormen, C.E. Leiserson, R.L. Riest and C. Stein, “Introduction to Algorithms”, 2nd Edition, MIT Press, 2001.
4. B. Das and V. Bharghavan , “Routing in Ad Hoc Networks Using Minimum Connected Dominating set”, in Proceedings of International Conference on Communications’ 97, Montreal, Canada. June 1997.
5. J.R Griggs and J.P. Hutchinson, “On the r-domination number of a graph”, Discrete Mathematics, 101, 1992, pp. 65–72.