University of TehranJournal of Algorithms and Computation2476-277650120180601$k$-Total prime cordial labeling of graphs14314968651ENRPonrajDepartment of Mathematics,
Sri Paramakalyani College,
Alwarkurichi-627412JMaruthamaniResearch Scholar,
Department of Mathematics
Manonmaniam sundarnar university, Abishekapatti,
Tirunelveli-627 012,
Tamilnadu, India.RKalaDepartment of Mathematics,
Manonmaniam sundarnar university, Abishekapatti,
Tirunelveli-627 012, Tamilnadu, India.Journal Article20180207In this paper we introduce a new graph labeling method called $k$-Total prime cordial. 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, ldots, k}$ where $t_{f}(x)$ denotes the total number of vertices and the edges labeled with $x$. We investigate k-total prime cordial labeling of some graphs and study the 4-total prime cordial labeling of path, cycle, complete graph etc.https://jac.ut.ac.ir/article_68651_1dc2872652857fc9a585a106b9f4f744.pdf