TOTAL COLORING OF MIDDLE GRAPH OF CERTAIN SNAKE GRAPH FAMILIES

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 the same colors. In this paper, we have dis- cussed the total coloring of M (Tn), M (Dn), M (DTn), M (ATn), M (DA(Tn)),
M (Qn), M (AQn) and also obtained the total chromatic number of M (Tn), M (Dn), M (DTn), M (ATn), M (DA(Tn)), M (Qn), M (AQn).