Effects of Some Operations on Domination Chromatic Number in Graphs

Yangyang Zhou, Dongyang Zhao

For a simple graph $G$, a domination coloring of $G$ is a proper vertex coloring such that every vertex of $G$ dominates at least one color class, and every color class is dominate…