Labeling of splitting graph of a bipartite graph

Abstract

The graph consisting Union of two vertex set with two vertices are adjacent if they correspond to adjacent edges of G or one edge is in one subset and the other is in another subset. This results split of a graph. Splitting of graph creates new variations and varieties in the original graph structure. In this paper, it is proved that a splitting graph of a complete bipartite graph satisfies graceful and alpha labeling.