• SPLITTING GRAPH ON EVEN SUM CORDIAL LABELING OF GRAPHS

R. VIKRAMAPRASAD, R. DHAVASEELAN, S. ABHIRAMI

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:

PDF


Creative Commons License
This 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		Web Counter
https://journals.zetech.ac.ke/scatter-hitam/https://silasa.sarolangunkab.go.id/swal/https://sipirus.sukabumikab.go.id/storage/uploads/-/sthai/https://sipirus.sukabumikab.go.id/storage/uploads/-/stoto/https://alwasilahlilhasanah.ac.id/starlight-princess-1000/https://www.remap.ugto.mx/pages/slot-luar-negeri-winrate-tertinggi/https://waper.serdangbedagaikab.go.id/storage/sgacor/https://waper.serdangbedagaikab.go.id/public/images/qrcode/slot-dana/https://waper.serdangbedagaikab.go.id/public/img/cover/10k/https://waper.serdangbedagaikab.go.id/storage/app/https://waper.serdangbedagaikab.go.id/storage/idn/