Menu
Among the varius coloring of graphs, the concept of equitable total coloring of graph \(G\) is the coloring of all its vertices and edges in which the number of elements in any two color classes differ by atmost one. The minimum number of colors required is called its equitable total chromatic number. In this paper, we obtained an equitable total chromatic number of middle graph of path, middle graph of cycle, total graph of path and total graph of cycle.