We treat a variation of graph domination which involves partition ( V 1 , 2 ,..., k ) the vertex set G and each class i over distance d where all vertices edges may be used in process. Strict upper bounds extremal graphs are presented; results collected three handy tables. Further, we compare high number classes dominators needed.