Given a graph G with vertex set and edge set, a function defined from vertex set and edge set to 1, 2, ..., k is called an edge irregular total k-labeling if for every pair of distinct edges, the weight of the edges are all distinct. The minimum k for which G has an edge irregular total klabeling is called the total edge irregularity strength of G. The total edge irregularity strength of G is denoted by tes(G). In our present study we have considered some graphs of the family of convex polytopes and have obtained their total edge irregularity strength.