1. Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. CRC Press, Boca Raton (1998)
2. Haynes, T.W., Hedetniemi, S., Slater, P.J.: Fundamentals of domination in graphs. In: Monographs and Textbooks in Pure and Applied Mathematics, vol. 208. Marcel Dekker, Inc., New York (1998)
3. Chang, G.J.: Algorithmic Aspects of Domination in Graphs. In: Handbook of combinatorial optimization, pp. 1811–1877. Springer, New York (1998)
4. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, Heidelberg (1999)
5. Liao, C.-S., Chang, G.J.: Algorithmic aspect of $$k$$-tuple domination in graphs. Taiwan. J. Math. 6(3), 415–420 (2002)