R. Ponraj

Difference cordiality of product related graphs

Abstract 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 an injective 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 which admits a difference cordial labeling is called a difference cordial graph. In this paper, we investigate the difference cordiality of torus grids Cm × Cn, Km × P2, prism, book, mobius ladder, Mongolian tent and n-cube.