Total dominator chromatic number of specific graphs

Saeid Alikhani, Nima Ghanbari

Let $G$ be a simple graph. A total dominator coloring of $G$ is a proper coloring of the vertices of $G$ in which each vertex of the graph is adjacent to every vertex of some color…