Total Chromatic Number of Middle and Total Graph of Path and Sunlet Graph

A total coloring of a graph G is an assignment of colors to both the vertices and edges of G, such that no two adjacent or incident vertices and edges of G are assigned with the same colors. In this paper, we discussed the theorems some total coloring of middle graph, total graph of path and sunlet graph. Also, we obtained the total chromatic number of middle graph, total graph of path and sun let graph.