Square Prime Cordial Labeling in Some Operations in Graphs

In this paper, we study Square Prime Cordial (SPC) labeling, which is a variation of cordial and prime cordial labeling. We investigate whether graphs formed by disconnected union and corona operations admit SPC labeling. In particular, we consider these operations on path, cycle, star, wheel, and helm graphs. For each graph structure, we construct an explicit vertex labeling function and prove that the number of edges with label 0 and label 1 differ by at most one. We also provide illustrative examples and diagrams to verify our results. We provide the constructive proofs for SPC labeling of the graphs [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text] and [Formula: see text].