Difference Cordial Labeling of Subdivision of Snake Graphs
Raja Ponraj, S. Sathish Narayanan, R. Kala · Universal Journal of Applied Mathematics · 2014
Let G be a (p; q) graph. Let f : V (G) → {1; 2 ...,p} be a function. For each edge uv, assign the label |f (u) − f (v)|. 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 subdivision of some snake graphs.