Study on the Some Labelings of Complete Bipartite Graphs

Abstract

If the vertex set V of G = < V,E > can be divided into two un empty sets X and Y, X ∪ Y = V,X ∩ Y = ∅, but also two nodes of every edge belong to X and Y separately, the G is called bipartite graph. If ∀ x _i  ∈ X, y _i  ∈ Y, (x _i , y _i ) ∈ E then G is called complete bipartite graph. if ∣ X ∣ = m,∣ Y ∣ = n, the G is marked K _m,n . In this paper the graceful labeling, k-graceful labeling, odd graceful labeling and odd strongly harmonious labeling are given.