[1] F. Harary, “Graph Theory,” Addison-Wesley Publishing Company, Boston, 1969.
[2] T. W. Haynes, S. T. Hedetniemi and P. J. Slater, “Fundamentals of Domination in Graphs,” Marcel Dekker, New York, 1998.
[3] B. D. Acharya, “The Strong Domination Number of a Graph and Related Concepts,” Journal of Mathematical Physics, Vol. 14, No. 5, 1980, pp. 471-475.
[4] S. Arumugam and R. Kala, “Domsaturation Number of a Graph,” Indian Journal of Pure and Applied Mathematics, Vol. 33, No. 11, 2002, pp. 1671-1676.
[5] S. Arumugam and S. Velammal, “Edge Domination in Graphs,” Taiwanese Journal of Mathematics, Vol. 2, No. 2, 1998, pp. 173-179.
[6] A. Finbow, B. L. Hartnell and R. Nowakowski, “Well Dominated Graphs: A Collection of Covered Ones,” Ars Combinatoria, Vol. 25, No. A, 1988, pp. 5-10.