• SPLITTING GRAPH ON EVEN SUM CORDIAL LABELING OF GRAPHS
Abstract
In this paper, we investigate the splitting graph of the family of bipartite graphs, paths and cycles are even sum cordial graphs and proved several classes of graphs such that ,,, ,,Helm graph and Flower graph are even sum cordial graphs.
Keywords
Splitting graphs, Helm graphs, Flower graphs, Bistar.
Full Text:
PDFThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |