References
- Y. Alavi, M. Behzad, L.M. Lesniak-Foster, and E.A. Nordhaus, Total matchings and total coverings of graphs, J. Graph Theory 1 (1977), pp. 135–140. doi: 10.1002/jgt.3190010209
- P. Erdös and A. Meir, On total matching numbers and total covering numbers of complementary graphs, Discrete Math. 19 (1977), pp. 229–233. doi: 10.1016/0012-365X(77)90102-9
- T.W. Haynes, S.T. Hedetniemi, and P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.
- A. Khodkar and S.M. Sheikholeslami, Signed total k-domatic numbers of graphs, J. Korean Math. Soc. 48 (2011), pp. 551–563. doi: 10.4134/JKMS.2011.48.3.551
- J.K. Lan and G.J. Chang, On the mixed domination problem in graphs, Theoret. Comput. Sci. 476 (2013), pp. 84–93. doi: 10.1016/j.tcs.2012.11.035
- X.Z. Lv, A lower bound on the total signed domination numbers of graphs, Sci China Ser. A 50 (2007), pp. 1157–1162. doi: 10.1007/s11425-007-0053-0
- D.F. Manlove, On the algorithmic complexity of twelve covering and independence parameters of graphs, Discrete Appl. Math. 91(1–3) (1999), pp. 155–175. doi: 10.1016/S0166-218X(98)00147-4
- E.F. Shan and Y.C. Zhao, On signed mixed domination in graphs, Acta Math. Appl. Sin. Engl. Ser., to appear.
- S.M. Sheikholeslami and L. Volkmann, Signed total (k, k)-domatic number of digraphs, Aequationes Math. 83 (2012), pp. 87–96. doi: 10.1007/s00010-011-0077-y
- B. Zelinka, Signed total domination number of a graph, Czechoslovak Math. J. 51 (2001), pp. 225–229. doi: 10.1023/A:1013782511179
- Y.C. Zhao, L.Y. Kang, and M.Y. Sohn, The algorithmic complexity of mixed domination in graphs, Theoret. Comput. Sci. 412 (2011), pp. 2387–2392. doi: 10.1016/j.tcs.2011.01.029
- C.W. Zhou, Vertex-edge total signed domination number of a complete graph with even order, Acta Math. Appl. Sin. 33(1) (2010), pp. 112–117.