International Journal of Applied Research
Vol. 3, Issue 12, Part C (2017)
Dominator coloring and total dominator coloring of certains graphs
Let G be a graph, then the dominator coloring of G is a proper coloring, in which every vertex of G dominates every vertex of at least one color class. And the Total dominator coloring of graph is a proper coloring with extra property that every vertex in the graph properly dominates an entire color class.
In this paper, the dominator coloring and total dominator coloring of Prism, Sunlet and Sparse graphs have been presented. Also the relation between their chromatic number, dominator chromatic number and total dominator chromatic number have been discussed.
How to cite this article:
Dr. B Tamilselvi, Kokila S. Dominator coloring and total dominator coloring of certains graphs. Int J Appl Res 2017;3(12):151-154.