Penentuan Nilai Total Ketidakteraturan Sisi Graf Convex Polytope

An edge irregular total k-labeling of a graph G is a labeling of the vertices and edges with labels 1,2,???,k such that the weights of all edges are distinct, where the weight of an edge e is the sum of the label of e and the labels of its two end vertices. The minimum k such that G have edge irregular total k-labeling is called the total edge irregularity strength of G, denoted by tes (G). \ud In this thesis, we have determined the total edge irregularity strength of convex polytope graph A_n for n???3 and its result is\ud tes (A_n )=???(7n+2)/3???