4-Total prime cordial labeling of some cycle related graphs

Let G be a (p; q) graph. Let f : V (G) ! f1; 2; ... ; kg be a map where k 2 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 jtf (i) 􀀀 tf (j)j 1, i; j 2 f1; 2; ... ; kg where tf (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 like Prism, Helm, Dumbbell graph, Sun ower graph.