Let G = (V, E) be k-colorable (k-vertex colorable) graph and Vi ⊆ V be the class of vertices with color i. Then we assume that f = (V1, V2, · · · , Vk) is a coloring of G. A vertex v ∈ V (G) is a dominator of f if v dominates ...