Total Chromatic Number of Middle and Total Graph for Certain Graphs

Abstract

A total coloring of a graph  is an assignment of colors to both the vertices and edges of  such that no two adjacent or incident vertices and edges of  are assigned the same colors. In this paper, we have discussed the total coloring and total chromatic number of middle graph, total graph of twig graph and comb graph.