Total Chromatic Number of Some Classes of Graphs

Abstract

A total coloring of a graph is a coloring to the elements (vertices and edges) of thegraph, for which any adjacent vertices or edges and incident elements are colored differently.  The total chromatic number of  is the minimum number of colors that needed in a total coloring. In this paper, we have determined the total chromatic number for pan graph, double wheel graph and double crown graph.