Signed \(k\)-domatic numbers of graphs. (Q2828863)

Signed \(k\)-domatic numbers of graphs are defined as a generalization of domatic numbers. Let \(G=(V,E)\) be a graph. A signed \(k\)-dominating function is a function \(f:(V) \to \{-1,1 \}\) such that summation of values of \(f\) over any closed neighborhood of a vertex is at least \(k\). A set \(\left\{ f_1,f_2,\dots ,f_d\right\}\) of signed \(k\)-dominating functions with property that \(\sum_{i=1}^{d}f_i(v)\leq 1\) for each \(v\in V\), is called a signed \(k\)-dominating family. The maximum number of functions in a signed \(k\)-dominating family is the signed \(k\)-domatic number.NEWLINENEWLINE Basic properties of signed \(k\)-domatic numbers are presented. The main result of the paper is finding exact values of signed \(k\)-domatic numbers for complete graphs \(K_n\) and complete bipartite graphs \(K_{n,n}\).