Dominated Coloring of Some Classes of Perfect and Unicyclic Graphs

@misc{sneha2026dominated,
  title = {{Dominated Coloring of Some Classes of Perfect and Unicyclic Graphs}},
  author = {Sneha R and J. Geetha and K. Somasundaram},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.32439},
  eprint = {2609.32439},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.32439},
  note = {CC BY 4.0},
}

TY  - UNPB
TI  - Dominated Coloring of Some Classes of Perfect and Unicyclic Graphs
AU  - Sneha R
AU  - J. Geetha
AU  - K. Somasundaram
PY  - 2026
DA  - 2026/09/26
PB  - arXiv
DO  - 10.48550/arxiv.2609.32439
UR  - https://arxiv.org/abs/2609.32439
AB  - 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 χ_dom(G). A graph G is said to be chromatic dominated if χ(G)=χ_dom(G). In this paper, we characterized the perfect graphs, which are chromatic dominated. Also, we studied the dominated chromatic number of some classes of unicyclic graphs.
ER  -