3-DIFFERENCE CORDIALITY OF SOME SPECIAL GRAPHS

Let G be a (p, q) graph. Let f : V(G) -> {1, 2, ... , k} be a map where k is an integer 2 <= k <= p. For each edge uv, assign the label vertical bar f (u) - f (v)vertical bar. f is called k-difference cordial labeling of G if vertical bar v(f )(i) - V-f (j)vertical bar <= 1 and vertical bar e(f)(0) - e(f) (1)vertical bar <= 1 where v(f)(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-difference cordial labeling is called a k-difference cordial graph. In this paper we investigate 3-difference cordial labeling behavior of ladder, book, dumbbell graph, and umbrella graph.