A partition of V(G), all of whose classes arę dominating sets in G, is called a domatic partition of G. The maximum number of classes of a domatic partition of G is called the domatic nuraber of G. In this paper we explore the bounds for the domatic numbers of the cartesian product, the strong product and the join of two graphs. The bounds are the best possible in the sense that there exist examples for which equalities are attained.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.