Abstract: A coloring of vertices and edges of a graph G is said to be total coloring if no two adjacent or incident elements of have the same color. The minimum number of colors required for a total coloring is said to be the total chromatic number of G and is denoted by T (G). In this paper, we have discussed the total chromatic number of closed Helm, Flower and Bistar Graph Families.