Difference cordiality of product related graphs

Let G be a (p,q) graph. Let f : V (G) -> {1,2, . . . , p} be a function. For each edhe uv, assign the label vertical bar f(u) - F(v)vertical bar. f is called a difference cordial labeling if f is an injective map and vertical bar e(f) (0) - e(f) (1)vertical bar <= 1 where e(f) (1) and e(f) (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 C-m x C-n, K-m x P-2 prism, hook, mobius ladder, Mongolian tent and n-cube.