The concept of dominator coloring of graphs emerged as a combination of the two prominent structural aspects of graphs, namely coloring and domination in graphs. The vertex coloring that demands the existence of a rainbow path between any two vertices of a graph; that is, a path in which every internal vertex has a unique color, is called a rainbow vertex coloring of a graph. Melding the concepts of rainbow vertex coloring and dominator coloring of graphs, the rainbow dominator coloring of graphs has been studied, in the literature. In this article, we investigate the rainbow dominator coloring of some cycle related graphs, and their complements
Discussion(0)
No comments yet. Be the first to comment.