%0 Journal Article
%T $4$-Total prime cordial labeling of some cycle related graphs
%J Journal of Algorithms and Computation
%I University of Tehran
%Z 2476-2776
%A Ponraj, R
%A Maruthamani, J
%D 2018
%\ 12/30/2018
%V 50
%N issue 2
%P 49-57
%! $4$-Total prime cordial labeling of some cycle related graphs
%K Prism
%K Helm
%K Dumbbell graph
%K Sun flower graph
%R 10.22059/jac.2018.69777
%X 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.
%U https://jac.ut.ac.ir/article_69777_b697bb2042469a4545ccaf731813c86a.pdf