• Journal of the Korean Mathematical Society
• /
• v.48 no.3
• /
• pp.551-563
• /
• 2011

Let ${\kappa}$ be a positive integer and let G be a simple graph with vertex set V(G). A function f : V (G) ${\rightarrow}$ {-1, 1} is called a signed total ${\kappa}$-dominating function if ${\sum}_{u{\in}N({\upsilon})}f(u){\geq}{\kappa}$ for each vertex ${\upsilon}{\in}V(G)$. A set ${f_1,f_2,{\ldots},f_d}$ of signed total ${\kappa}$-dominating functions of G with the property that ${\sum}^d_{i=1}f_i({\upsilon}){\leq}1$ for each ${\upsilon}{\in}V(G)$, is called a signed total ${\kappa}$-dominating family (of functions) of G. The maximum number of functions in a signed total ${\kappa}$-dominating family of G is the signed total k-domatic number of G, denoted by $d^t_{kS}$(G). In this note we initiate the study of the signed total k-domatic numbers of graphs and present some sharp upper bounds for this parameter. We also determine the signed total signed total ${\kappa}$-domatic numbers of complete graphs and complete bipartite graphs.