Title of article :
k-Total prime cordial labeling of graphs
Author/Authors :
Ponraj, R Department of Mathematics - Sri Paramakalyani College - Alwarkurichi - Tamilnadu, India , Maruthamani, J Department of Mathematics - Manonmaniam sundarnar university - Abishekapatti, Tirunelveli - Tamilnadu, India , Kala, R Department of Mathematics - Manonmaniam sundarnar university - Abishekapatti - Tirunelveli - Tamilnadu, India
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) ! f1; 2; ... ; kg be a map where k 2
N and k > 1. For each edge uv, assign the label
gcd(f(u); f(v)). f is called k-Total prime cordial label-
ing of G if jtf (i) tf (j)j 1, i; j 2 f1; 2; ... ; kg where
tf (x) denotes the total number of vertices and the edges
labeled with x. We investigate k-total prime cordial la-
beling of some graphs and study the 4-total prime cor-
dial labeling of path, cycle, complete graph etc.
Keywords :
Path , cycle , complete graph , star , bistar
Journal title :
Astroparticle Physics
