Color class dominations sets in various classes of graphs

Abstract

Let $G=(V, E)$ be a graph. A color class dominating set of $G$ is a proper coloring $\mathscr{C}$ of $G$ with the extra property that every color class in $\mathscr{C}$ is dominated by a vertex in $G$. A color class dominating set is said to be a minimal color class dominating set if no proper subset of $\mathscr{C}$ is a color class dominating set of $G$. The color class domination number of $G$ is the minimum cardinality taken over all minimal color class dominating sets of $G$ and is denoted by $\gamma_\chi(G)$. Here we also obtain $\gamma_\chi(G)$ for Multi-star graph, Windmill graph, Barbell graph, Lollipop graph, Complete m-partite graph, Fan graph, Crown graph and Cocktail party graph.