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(T n ),M(D n ),M(DT n ),M(AT n ),M(DA(T n )),
M(Q n ),M(AQ n ) and also obtained the total chromatic number of M(T n ),
M(D n ),M(DT n ),M(AT n ),M(DA(T n )),M(Q n ),M(AQ n ).