Haynes T W, Hedetniemi S T, Slater P J. Fundamentals of Domination in Graphs [M]. New York: Marcel Dekker, 1998. Haynes T W, Hedetniemi S T, Slater P J. Domination in Graphs - Advanced Topics [M]. New York: Marcel Dekker, 1998. Wang F, Camacho E, Xu K. Positive influence dominating set in online social networks [J]. Lect Notes Comput Sci, 2009, 5573: 313-321. Wang F, Du H, Camacho E, et al. On positive influence dominating sets in social networks [J]. Theor Comput Sci, 2011, 412: 265-269. Lee C M. On the complexity of signed and minus total domination in graphs [J]. Inform Process Lett, 2009, 109: 1177-1181. Henning M A. Signed total domination in graph [J]. Discrete Math, 2004, 278: 109-125. Henning M A. On the signed total domatic number of a graph [J]. ARS Combin, 2006, 79: 277-288. Pfaff J, Laskar R, Hedetniemi S T. NP-completeness of total and connected domination and irredundance for bipartite graphs [J]. Tech Report 428, Clemson Univ, Dept Mathematical Sci, 1983. Shan E F, Cheng T C E. Remarks on the minus (signed) total domination in graphs [J]. Discrete Math, 2008, 308: 3373-3380. Shan E F, Cheng T C E. Upper bounds on the upper signed total domination number of graphs [J]. Discrete Appl Math, 2009, 157: 1098-1103. Zelinka B. Signed total domination number of a graph [J]. Czechoslovak Math J, 2001, 51: 225-229. |