Pair difference cordial labeling of planar grid and mangolian tent

Let G = (V,E) be a (p, q) graph. Define =(p2 , if p is evenp−12 , if p is oddand L = {±1,±2,±3, · · · ,±} called the set of labels.Consider a mapping f : V −! L by assigning differentlabels in L to the different elements of V when p is even and different labels in L to p-1 elements of V and re-peating a label for the remaining one vertex when p is odd.The labeling as defined above is said to be a pair dif-ference cordial labeling if for each edge uv of G there ex- ists a labeling |f(u) − f(v)| such thatf1 − fc1 1