Splitting Graph on Even Sum Cordial Labeling of Graphs

In this paper, we investigate the splitting graph of the family of bipartite graphs, focusing on paths and cycles as even sum cordial graphs. We prove that several classes of graphs, including Pm(+)Kn, (Kn[Pm) + 2K1, hW(1)n, W(2)\nn i, Bn;n, S(Bn;n), Helm graph Hn, and Flower graph Fln, are even sum cordial graphs. These findings expand the understanding of graph labeling and its applications, offering new insights into the structural properties of these graphs. The study also highlights the mathematical intricacies involved in cordial labeling and its potential use in network theory and combinatorial optimization.