TOTAL EDGE IRREGULARITY STRENGTH OF COMPLETE 3-PARTITE GRAPHS K_(1,1.m) AND K_(1,2,M)
Andi Muhammad Anwar · 2017
A total edge irregular -labeling of a graph G=(V,E) is a labeling \phi:V(G) \cup E(G) -> {1,2,3,...,k} such that the weight of any two different edge are distinct. The weight of an edge uv is wt(uv)=\phi(u)+\phi(v)+\phi(uv) . The total edge irregularity strength of ,tes(G) , is the minimum k for which a graph G has a total edge irregular k-labeling. In this paper, the total edge irregularity strength of complete 3-partite graphs K_(1,1,m) and K_(1,2,m) are shown.