Abstract
A dominator coloring of a graph G is a proper coloring of the vertices of G in which each vertex of the graph dominates every vertex of some color class, where a vertex dominates itself and all vertices adjacent to it. The dominator chromatic number of G is the minimum number of colors among all dominator coloring of G. A total dominator coloring of a graph G is a proper coloring of the vertices of G in which each vertex of the graph dominates every vertex of some color class other than its own. The total dominator chromatic number of G is the minimum number of colors among all total dominator coloring of G. In this chapter, we present selected results on the dominator chromatic number and total dominator chromatic number of a graph.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call