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 |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (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 Pn.
Ponraj, R., Singh, R., & Sathish Narayanan, S. (2016). A note on 3-Prime cordial graphs. Journal of Algorithms and Computation, 48(1), 45-55. doi: 10.22059/jac.2016.7939
MLA
R. Ponraj; Rajpal Singh; S. Sathish Narayanan. "A note on 3-Prime cordial graphs". Journal of Algorithms and Computation, 48, 1, 2016, 45-55. doi: 10.22059/jac.2016.7939
HARVARD
Ponraj, R., Singh, R., Sathish Narayanan, S. (2016). 'A note on 3-Prime cordial graphs', Journal of Algorithms and Computation, 48(1), pp. 45-55. doi: 10.22059/jac.2016.7939
VANCOUVER
Ponraj, R., Singh, R., Sathish Narayanan, S. A note on 3-Prime cordial graphs. Journal of Algorithms and Computation, 2016; 48(1): 45-55. doi: 10.22059/jac.2016.7939
)