Document Type : Research Paper

Authors

• R. Ponraj ¹
• Rajpal Singh ²
• S. Sathish Narayanan ¹

¹ Department of Mathematics, Sri Paramakalyani College,Alwarkurichi-627412, India

² Research Scholar, Department of Mathematics Manonmaniam Sundaranar University, Tirunelveli-627012, India

Abstract

Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |v_f (i) − v_f (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |e_f (0) − e_f (1)| ≤ 1 where v_f (x) denotes the number of vertices labeled with x, e_f (1) and e_f (0) respectively denote the number of edges labeled with 1 and not labeled with 1. A graph with a k-prime cordial labeling is called a k-prime cordial graph. In this paper we investigate 3- prime cordial labeling behavior of union of a 3-prime cordial graph and a path P_n.

Keywords

• Path
• union of graphs