Rainbow Dominator Coloring of Graphs

Coloring and domination in graphs are two well explored areas of research in graph theory. Blending these notions, the dominator coloring of graphs was introduced in the literature; following which several variants of domination related coloring patterns have been defined and studied, based on different types of coloring and domination in graphs. A vertex coloring of a graph that demands the existence of a path in which every internal vertex between two vertices has a unique color is called a rainbow vertex coloring of the graph. In this article, we investigate the rainbow dominator coloring of graphs; a vertex coloring that combines the concepts of rainbow vertex coloring and dominator coloring of graphs. We discuss some properties of the rainbow dominator coloring of graphs and determine the rainbow dominator chromatic number of certain classes of graphs and their complements.