A note on dominator chromatic number of some graphs
R Kalaivani, D. Vijayalakshmi · Journal of Physics Conference Series · 2018
Gera and S. Horton introduced a new type of coloring of a graph g with p vertices and q edges called Dominator Coloring (DC). A Dc is a coloring of the vertices of a graph such that every vertex is either alone in its color class or adjacent to all vertices of at least one other color class. In this paper section the exact value for χd of Web graph( Wb n ), Polar grid graph ( P m, n ), Knodelgraph ( W Δ, n ), theta graph ( θ* ( n , 1, p )) and Herschel graph ( H s ) are obtained.