Difference cordial labeling of corona graphs

Abstract

Let G be a (p,q) graph. Let f be a map from V (G) to {1,2,...,p}. For each edge xy, assign the label |f (x) − f (y)|. f is called a difference cordial labeling if f is a one to one map and |ef(0) − ef(1)| ≤ 1 where ef(1) and ef(0) denote the number of edges labeled with 1 and not labeled with 1 respectively. A graph with a difference cordial labeling is called a difference cordial graph. In this paper, we investigate the difference cordial labeling behavior of G⊙Pn, G⊙mK1 (m = 1,2,3) where G is either a unicycle or a tree and G1⊙ G2where G1and G2are some more standard graphs.