%0 Journal Article
%T 4-Prime cordiality of some classes of graphs
%J Journal of Algorithms and Computation
%I University of Tehran
%Z 2476-2776
%A Ponraj, R.
%A Singh, Rajpal
%A Sathish Narayanan, S.
%A Ramasamy, A. M. S.
%D 2016
%\ 12/15/2016
%V 48
%N 1
%P 69-79
%! 4-Prime cordiality of some classes of graphs
%K complete graph
%K Wheel
%K Path
%K book
%K flower
%R 10.22059/jac.2016.7941
%X 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 4- prime cordial labeling behavior of complete graph, book, flower, mCn and some more graphs.
%U https://jac.ut.ac.ir/article_7941_01050790c89557f0425ee26385c3b6b9.pdf