TOTAL COLORING OF CERTAIN GRAPHS
A total coloring of a graph G is an assignment of colors to both vertices and edges of G, such that no two adjacent or incident vertices of G receive the same color. In this paper, we have discussed the total coloring and total chromatic number of twig graph Tn, splitting graph of comb graph and shadow graph of comb graph
twig graph, comb graph, splitting graph, shadow graph, total coloring, total chromatic number.
