k-Total prime cordial labeling of graphs

Message:
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:

In 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.the formula is not displayed correctly!

Language:
English
Published:
Journal of Algorithms and Computation, Volume:50 Issue: 1, Jun 2018
Pages:
143 to 149
https://www.magiran.com/p2116093