Strong-weak domatic numbers of graphs (Q1860739)

If \(u\), \(v\) are adjacent vertices of a graph \(G\) and \(\deg u\geq\deg v\) then \(u\) is said to dominate \(v\) strongly and \(v\) is said to dominate \(u\) weakly. A subset \(D\) of the vertex set \(V\) of \(G\) is called a strongly (or weakly) dominating set in \(G\), if each vertex of \(V\setminus D\) is strongly (or, respectively, weakly) dominated by a vertex of \(D\). The minimum number of vertices of a strongly (or weakly) dominating set in \(G\) is the strong domination number \(\gamma_s(G)\) (or, respectively, the weak domination number \(\gamma_w(G)\)). A strong-weak domatic partition of \(G\) is a partition of \(V\), each class of which is a strongly dominating set, or a weakly dominating set in \(G\). The maximum number of classes of a strong-weak domatic partition of \(G\) is the strong-weak domatic number of \(G\). These concepts, together with the (usual) domination number are studied.