A dominating set of a graph G = (V, E) may be a subset D of V. such every vertex not in D is adjacent to some vertex in D. The domatic number d(G) of G is that the maximum positive integer K. such V are often partitioned into K pairwise disjoint dominating sets. the aim of this paper is to review the domatic numbers and domination numbers of a graphs that are obtained from small graphs by performing graph operations.