On Dominator Coloring in Circulant Graphs

Abstract

The concept of dominator chromatic number was introduced by Gera et al. [4]. A dominator coloring of G is a proper coloring in which every vertex of G dominates every vertex of at least one color class. The  dominator chromatic number, is the minimum number of colors, which a dominator coloring of G requires.In this paper we found the dominator coloring of Circulant graph.