Some Results on Prime Cordial Labeling of Graphs

A Prime Cordial labeling of a graph with the vertex set is a bijection from such that each edge is assigned the label, if and 0 if then the number of edges labeled with 0 and the number of edges labeled with 1 differ by atmost 1. A graph which admits a prime cordial labeling is called a prime cordial graph. In this paper, we prove that the ternary-tree and, are prime cordial.