4-prime cordial labeling of some degree splitting graphs

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 labelling of G if |vf(i)-vf(j)| ≤1, i, je(1, 2, …, k) and |ef(0)-ef(1)| ≤1 where vf(x) denotes the number of vertices labelled with x, ef(1) and ef(0) respectively denote the number of edges labelled with 1 and not labelled with 1. A graph with a k-prime cordial labelling is called a k-prime cordial graph. In this paper we investigate 4-prime cordial labelling behaviour of degree splitting graph of path, jelly fish, crown and bistar and some more graphs.