Preview only show first 10 pages with watermark. For full document please download

Dominator Coloring Number Of Some Graphs

Description: Given a graph G, the dominator coloring problem seeks a proper coloring of G with the additional property that every vertex in the graph dominates an entire color class. In this paper, as an extens...

   EMBED

Share

Transcript

Given a graph G, the dominator coloring problem seeks a proper coloring of G with the additional property that every vertex in the graph dominates an entire color class. In this paper, as an extension of Dominator coloring some standard results has been discussed and the solutions for some of the open problems in [2] are also found out.