Some New Results on Prime Cordial Labeling

A prime cordial labeling of a graph with the vertex set is a bijection such that each edge is assigned the label 1 if and 0 if ; then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph which admits a prime cordial labeling is called a prime cordial graph. In this work we give a method to construct larger prime cordial graph using a given prime cordial graph . In addition to this we have investigated the prime cordial labeling for double fan and degree splitting graphs of path as well as bistar. Moreover we prove that the graph obtained by duplication of an edge (spoke as well as rim) in wheel admits prime cordial labeling.