Dominator Coloring of Hajós and Trampoline graph
T. Manjula, R. Raja Rajeswari · Journal of Physics Conference Series · 2021
Abstract A proper node coloring of a graph where every node of the graph dominates all nodes of some color class is called the dominator coloring of the graph. The least number of colors used in the dominator coloring of a graph is called the dominator coloring number denoted by χd (G). The dominator coloring number and domination number of generalized Hajós graph, partial generalized Hajós graph and trampoline are derived and the relation between them are expressed in this paper.