SOME 3-PRIME CORDIAL 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 vertical bar v(f)(i) - v(f)(j)vertical bar <= 1, i, j is an element of {1, 2, ..., k} and vertical bar e(f)(0) - e(f)(1)vertical bar <= 1 where v(f)(x) denotes the number of vertices labeled with x, e(f)(1) and e(f)(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 3-prime cordial labeling behavior of subdivison of a star, bistar, double comb, C-3(t) and some more graphs.