Prime Cordial Labeling

Abstract

We show that some special families of graphs have prime cordial labeling. We prove that If G is not a prime cordial graph of order m then G∪K_(1,n)is a prime cordial graph if E(G)= n-1,n or n+1 , and we prove that S^' (K_(2,n)), Jelly fish graph , Jewel graph, the graph obtained by duplicating a vertex v_k in the rim of the helm H_nand the graph obtained by fusing the vertex u_1 with u_3in a Helm graphH_n are prime cordial graphs.