Let G=(V, E) be a finite, undirected simple graph with p vertices and q edges. A total mean labeling of G is a bijection f from V(G)E(G) to {1,2,…,p+q} such that for each edge 3 ( ) ( ) ( ) ( ), *( ) f u f v f uv uv E G f uv is distinct. A graph which admits a total mean labeling is called a total mean labeling graph. In this paper, we prove that , , , , Pn Pn K1,n K2,n , , Cn Bm,n Triangular snakes and Alternate Triangular snakes are total mean labeling graphs.