G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi, Complexity and approximation, Springer, Berlin, 1999.
 L. Chen, W. Zeng, and C. Lu, Np-completeness and apx-completeness of restrained domination in graphs, Theoret. Comput. Sci. 448 (2012), 1–8.
 M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of npcompleteness (series of books in the mathematical sciences), ed, Computers and Intractability (1979), 340.
 W. Goddard, M.A. Henning, and C.A. McPillan, Semitotal domination in graphs, Util. Math. 94 (2014), 67–81.
 T.W. Haynes, S. Hedetniemi, and P. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.
 O. [Ore, Theory of graphs, vol. 38, American Mathematical Society, 1962.
 C.H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. System Sci. 43 (1991), no. 3, 425–440.
 E. Zhu, Z. Shao, and J. Xu, Semitotal domination in claw-free cubic graphs, Graphs Combin. 33 (2017), no. 5, 1119–1130.