Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{147602,
        author = {G Divya Dharshini and U Mary},
        title = {Cordial labeling of graphs},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {5},
        number = {9},
        pages = {165-167},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=147602},
        abstract = {Let G={V,E} be a graph. A mapping f : V(G)→{0,1} is called Binary Vertex  Labeling. A Binary Vertex Labeling of a graph G is called a Cordial Labeling if |v_f (0)-v_f (1)|≤1 and |e_f (0)-e_f (1)|≤1. A graph G is Cordial if it admits Cordial Labeling. Here, we prove that Sunlet graph (S_n) and Shell graph C_((n,n-3)) are Cordial and the Splitting graphs of them are also Cordial.},
        keywords = {Cordial labeling ,Splitting graph},
        month = {},
        }