total dominator chromatic number of a graph

Given a graph g, the total dominator coloring problem seeks a proper coloring of g with the additional property that every vertex in the graph is adjacent to all vertices of a color class. we seek to minimize the number of color classes. we initiate to study this problem on several classes of graphs, as well as finding general bounds and characterizations. we also compare the total dominator chromatic number of a graph with the chromatic number and the total domination number of it.