Preprint
Sep 2026
Dominated Coloring of Some Classes of Perfect and Unicyclic Graphs
The dominated coloring of a graph $G$ is a proper vertex coloring such that each color class is dominated by a vertex. The minimum number of colors required for a dominated coloring of a graph $G$ is called the dominated chromatic number of the graph $G$ and is denoted by $\chi_{dom}(G)$. A graph $G$ is said to be chro...
R. Sneha, J. Geetha, K. Somasundaram
· 0 citations