@article {
author = {Ponraj, R. and Singh, Rajpal and Sathish Narayanan, S.},
title = {A note on 3-Prime cordial graphs},
journal = {Journal of Algorithms and Computation},
volume = {48},
number = {1},
pages = {45-55},
year = {2016},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {10.22059/jac.2016.7939},
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 |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.},
keywords = {Path,union of graphs},
url = {https://jac.ut.ac.ir/article_7939.html},
eprint = {https://jac.ut.ac.ir/article_7939_495c61efe2289c038edc6c7099386507.pdf}
}