Prime cordial labeling of some special graph families

A bijection f from vertex set V of a graph G to f1; 2; : : : ; jV jg is called a prime cordial labeling of G if each edge uv is assigned the label 1 if gcd(f(u); f(v)) = 1 and 0 if gcd(f(u); f(v)) > 1, where 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 some new constructions on prime cordial graphs.