A total dominator coloring of a graph G is proper in which each vertex the adjacent to every some color class. The chromatic number minimum classes coloring. In this paper, we study on middle graphs by giving several bounds for case general and trees. Moreover, calculate explicitly known families graphs.
