4-prime Cordial Graphs Obtained from 4-prime Cordial Graphs

Abstract

Let G be a (p; q) graph. Let f : V (G) ! f1; 2; : : : ; kg be a
function. For each edge uv, assign the label gcd (f(u); f(v)). f is called k-prime cordial labeling of G if

vf (i)