![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_open_medium.gif)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_restricted_medium.gif)
On Dominator Coloring in Circulant Graphs
Subscribe/Renew Journal
The concept of dominator chromatic number was introduced by Gera et al. 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 χd(G) 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.
Keywords
Dominator Coloring, Dominator Chromatic Number, Circulant Graphs.
User
Subscription
Login to verify subscription
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 250
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 4