on the dominated chromatic number of certain graphs

‎let g be a simple graph‎. ‎the dominated coloring of g is a proper coloring of g such that each color class is dominated by at least one vertex‎. ‎the minimum number of colors needed for a dominated coloring of g is called the dominated chromatic number of g ‎, ‎denoted by χdom(g) ‎. ‎stability (bondage number) of dominated chromatic number of g is the minimum number of vertices (edges) of g whose removal changes the dominated chromatic number of g ‎. ‎in this paper‎, ‎we study the dominated chromatic number‎, ‎dominated stability and dominated bondage number of certain graphs‎.