4-Prime cordiality of some classes of graphs

Document Type : Research Paper

Authors

1 Department of Mathematics, Sri Paramakalyani College,Alwarkurichi-627 412, India

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

3 Department of Mathematics, Vel Tech Dr.R.R & Dr.S.R Technical University, Chennai-600002, 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 |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.

Keywords

Journal of Algorithms and Computation
Volume 48, Issue 1 - Serial Number 1
December 2016
Pages 69-79

Files

Share

How to cite

Statistics