A graph G(V,E) with vertex set V is said to have a prime labeling if its vertices are labeled with distinct integers 1, 2, . . . , |V | such that for each edge xy ∈ E the labels assigned to x and y are relatively prime. A prime cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, . . . , |V |} such that if each edge uv is assigned the label 1 if gcd(f(u), f(v)) = 1 ...