Labeling of Splitting Graph of a Bipartite Graph
G. Sathiamoorthy1, K. R. Sekar2
1G. Sathiamoorthy, Department of Mathematics, SASTRA eemed University, India.
2K. R. Sekar, School of Computing, SASTRA Deemed University, India..
Manuscript received on 24 March 2019 | Revised Manuscript received on 30 March 2019 | Manuscript published on 30 March 2019 | PP: 430-431 | Volume-7 Issue-6, March 2019 | Retrieval Number: F2355037619 /19©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
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
Keywords: Alpha labeling, complete Bipartite graph, Graceful labeling, Splitting Graph.MSC 2010: 05C78
Scope of the Article: Computer Graphics, Simulation, and Modelling