SOME 4-TOTAL PRIME CORDIAL LABELING OF GRAPHS

Let G be a (p, q) graph. Let f : V(G) -> {1, 2, ..., k} be a map where k is an element of N and k > 1. For each edge uv, assign the label gcd(f(u), f(v)). f is called k-Total prime cordial labeling of G if &VERBAR t(f) (i) - t(f) (j) &VERBAR <= 1, i, j is an element of {1, 2, ..., k} where t(f) (x) denotes the total number of vertices and the edges labelled with x. A graph with a k-total prime cordial labeling is called k-total prime cordial graph. In this paper we investigate the 4-total prime cordial labeling of some graphs.