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 |e_f(0)-e_f(1)|≤ 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 × C_n, K_m× P₂, prism, book, mobius ladder, Mongolian tent and n-cube.

Tbilisi Mathematical Journal, Vol. 8(2) (2015), pp. 41-47