let g be a (p, q) graph. let f : v (g) → {1, 2, . . . , k} be a map. for each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of g if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....