@article {
author = {Ponraj, R and SUBBULAKSHMI, S and Somasundaram, S},
title = {PD-prime cordial labeling of graphs},
journal = {Journal of Algorithms and Computation},
volume = {51},
number = {2},
pages = {1-7},
year = {2019},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {10.22059/jac.2019.75109},
abstract = {\vspace{0.2cm} Let $G$ be a graph and $f:V(G)\rightarrow \{1,2,3,.....\left|V(G)\right|\}$ be a bijection. Let $p_{uv}=f(u)f(v)$ and\\ $ d_{uv}= \begin{cases} \left[\frac{f(u)}{f(v)}\right] ~~if~~ f(u) \geq f(v)\\ \\ \left[\frac{f(v)}{f(u)}\right] ~~if~~ f(v) \geq f(u)\\ \end{cases} $\\ for all edge $uv \in E(G)$. For each edge $uv$ assign the label $1$ if $gcd (p_{uv}, d_{uv})=1$ or $0$ otherwise. $f$ is called PD-prime cordial labeling if $\left|e_{f}\left(0\right)-e_{f}\left(1\right) \right| \leq 1$ where $e_{f}\left(0\right)$ and $e_{f}\left(1\right)$ respectively denote the number of edges labelled with $0$ and $1$. A graph with admit a PD-prime cordial labeling is called PD-prime cordial graph. & & \vspace{0.2cm}},
keywords = {Path,Bistar,subdivison of star,subdivison of bistar,Wheel,Fan,double fan},
url = {https://jac.ut.ac.ir/article_75109.html},
eprint = {https://jac.ut.ac.ir/article_75109_617cbbcab35443d18a0bffd29ccc4cb6.pdf}
}