Study on the Some Labelings of Complete Bipartite Graphs

If the vertex set v of G=< V.E.> can be divided into two un empty sets X and Y, X boolean OR Y = V,X boolean AND Y=circle divide, but also two nodes of every edge belong to x and Y separately, the a is called bipartite graph. If for all x,is an element of X,y(i) is an element of Y,(x(i),y(i))is an element of E then G is called complete bipartite graph. if vertical bar X vertical bar = m vertical bar Y vertical bar = n, the a is marked K-m,K-n. In this paper the graceful labeling, k-graceful labeling, odd graceful labeling and odd strongly harmonious labeling are given.