Equitable Total Chromatic Number of Mycielskian of Graphs

Abstract

The equitable total chromatic number is the smallest integer k for which the graph G has a proper coloring of vertices and edges, such that the number of elements in any two color classes differs by atmost one. In this paper, we have obtained the equitable total chromatic number of Mycielskian of P_n, C_n and W_n.