References
- Behzad, M. (1967). A criterion for the planarity of a total graph. Math. Proc. Camb. Phil. Soc. 63(3): 679–681.
- Haynes, T. W., Hedetniemi, S. T., Slater, P. J., eds. (1998). Fundamentals Domination in Graphs. New York: Marcel Dekker, Inc.
- Haynes, T. W., Hedetniemi, S. T., Slater, P. J., eds. (1998). Domination in Graphs: Advanced Topics. New York: Marcel Dekker, Inc.
- Henning, M. A., Yeo, A. (2013). Total Domination in Graphs (Springer Monographs in Mathematics).
- West, D. B. (2001). Introduction to Graph Theory, 2nd ed. USA: Prentice Hall.
- Zhao, Y., Kang, L, Sohn, M. Y. (2011). The algorithmic complexity of mixed domination in graphs. Theor. Comput. Sci. 412(22): 2387–2392.