IIREGULAR TOTAL LABELING ON COMPLETE BIPARTITE GRAPH AND UNION OF COMPLETE BIPARTITE GRAPHS
Jamal Ibrahim Daoud, Wamiliana Wamiliana, Mustofa Usman, Asmiati Asmiati · 2010
Given a graph G = (V, E) with vertex set I and edge sea E, we define a labeling as a function, where weight of edge xy is written as w(x, y), Total labeling is the sum of xy-label and labels of the vertices that incident to x, thus w(x, X.F(x) X(y)},(,ry), ). labeling is called as edge irregular total i-tabeling of the graph G if far every, two different edges c andlof G, w(e) tir(f ). The smallest k in which graph G can be labeled as edge irregular total k-labeling is called as edge total irregularity strength anti is noted its tea (G). In this research, we are interested in linding tes(a) of the union of complete bipartite graphs it' 1,q and g29. Keywords and phrases: irregular total labeling, tes(G), bipartite graph. 'Corresponding author