University Of Tehran Press Journal of Algorithms and Computation 2476-2776 Articles in Press 2022 01 13 Pair difference cordial labeling of planar grid and mongolian tent 1 9 85484 10.22059/jac.2022.85484 EN Journal Article 2022 01 13 \noindent Let $G = (V, E)$ be a $(p,q)$ graph.\\<br />Define \begin{equation*}<br />\rho =<br />\begin{cases}<br />\frac{p}{2} ,& \text{if $p$ is even}\\<br />\frac{p-1}{2} ,& \text{if $p$ is odd}\\<br />\end{cases}<br />\end{equation*}\\ <br /> and $L = \{\pm1 ,\pm2, \pm3 , \cdots ,\pm\rho\}$ called the set of labels.\\<br />\noindent Consider a mapping $f : V \longrightarrow L$ by assigning different labels in L to the different elements of V when p is even and different labels in L to p-1 elements of V and repeating a label for the remaining one vertex when $p$ is odd.The labeling as defined  above is said to be a pair difference cordial labeling if for each edge $uv$ of $G$ there exists a labeling $\left|f(u) - f(v)\right|$ such that $\left|\Delta_{f_1} - \Delta_{f_1^c}\right| \leq 1$,  where $\Delta_{f_1}$ and $\Delta_{f_1^c}$ respectively denote the number of edges labeled with $1$ and number of edges not labeled with $1$. A graph $G$ for which there exists a pair difference cordial labeling is called a pair difference cordial graph. In this paper we investigate pair difference cordial labeling behavior of planar grid and mangolian tent graphs. https://jac.ut.ac.ir/article_85484_e3023a85223c575225e1ae0d841c5933.pdf