@article {
author = {Ponraj, R and Maruthamani, J},
title = {$4$-Total prime cordial labeling of some cycle related graphs},
journal = {Journal of Algorithms and Computation},
volume = {50},
number = {issue 2},
pages = {49-57},
year = {2018},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {10.22059/jac.2018.69777},
abstract = {Let $G$ be a $(p,q)$ graph. Let $f:V(G)\to\{1,2, \ldots, k\}$ be a map where $k \in \mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $\gcd(f(u),f(v))$. $f$ is called $k$-Total prime cordial labeling of $G$ if $\left|t_{f}(i)-t_{f}(j)\right|\leq 1$, $i,j \in \{1,2, \cdots,k\}$ where $t_{f}(x)$ denotes the total number of vertices and the edges labelled with $x$. A graph with a $k$-total prime cordial labeling is called $k$-total prime cordial graph. In this paper we investigate the $4$-total prime cordial labeling of some graphs like Prism, Helm, Dumbbell graph, Sun flower graph.},
keywords = {Prism,Helm,Dumbbell graph,Sun flower graph},
url = {https://jac.ut.ac.ir/article_69777.html},
eprint = {https://jac.ut.ac.ir/article_69777_b697bb2042469a4545ccaf731813c86a.pdf}
}