PRIME CORDIAL LABELING AND DUALITY
A prime cordial labeling of a graph G with vertex set V is a bijection f from V to such that each edge uv 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. In this paper, we exhibit prime cordial labeling for some class of cycle related graphs and discuss with duality of prime cordial labeling.
prime cordial, cycle, cordial, bijective, function.
