Author: G. Jothilakshmi
Abstract: A graph has a dominator coloring if it has a proper coloring in which each vertex of the graph dominates every vertex of some color class. The dominator chromatic number χd (G) is the minimum number of colors required for a dominator coloring of G. In this paper the dominator chromatic number for Lollipop graph is studied and also the relation between dominator chromatic number, domination number and chromatic number is shown.
Keywords: Coloring, Domination, Dominator Coloring, Lollipop graph Classification number: 05C15, 05C75
Full Issue
| View or download the full issue | PDF 66-71 |