Complexity of total dominator coloring in graphs

Michael A. Henning, Kusum, Arti Pandey +1

Let $G=(V,E)$ be a graph with no isolated vertices. A vertex $v$ totally dominate a vertex $w$ ($w\ne v$), if $v$ is adjacent to $w$. A set $D\subseteq V$ called a total dominati…