4-Prime cordiality of some classes of 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 labeling of G if |vf</sub> (i) − vf</sub> (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef</sub> (0) − ef</sub> (1)| ≤ 1 where vf</sub> (x) denotes the number of vertices labeled with x, ef</sub> (1) and ef</sub> (0) respectively denote the number of edges labeled with 1 and not labeled with 1. A graph with a k-prime cordial labeling is called a k-prime cordial graph. In this paper we investigate 4- prime cordial labeling behavior of complete graph, book, flower, mCn</sub> and some more graphs.the formula is not displayed correctly!