Signed total \((k,k)\)-domatic number of a graph (Q547554)

Let \(G\) be a finite and simple graph with vertex set \(V(G)\), and let \(f : V(G) \rightarrow \{-1, 1\}\) be a two-valued function. If \(k \geq 1\) is an integer and \(\sum x\in N(v) f(x) \geq k\) for each \(v \in V(G)\), where \(N(v)\) is the neighborhood of \(v\), then \(f\) is a signed total \(k\)-dominating function on \(G\). A set \(\{f_1, f_2,\cdots , f_d\}\) of signed total \(k\)-dominating functions on \(G\) with the property that \(\sum_{i=1}^d f_i(x) \leq k\) for each \(x \in V (G)\), is called a signed total \((k, k)\)-dominating family (of functions) on \(G\). The maximum number of functions in a signed total \((k, k)\)-dominating family on \(G\) is the signed total \((k, k)\)-domatic number on \(G\), denoted by \(d^k _{st}(G)\). In this paper, the authors initiate the study of the signed total \((k, k)\)-domatic number, and present different bounds on \(d^k_{st}(G)\). Some of their results are extensions of known properties of the signed total domatic number \(d_{st}(G) = d^1_{st}(G)\), given by Henning in 2006 [\textit{M.A. Henning}, ``On the signed total domatic number of a graph,'' Ars Comb. 79, 277--288 (2006; Zbl 1164.05421)].