89-97
4-Prime Cordial Labeling of Some Special Graphs
Authors: R.Ponraj, Rajpal Singh and R. Kala
Number of views: 187
Let G be a (p, q) graph. Let f : V (G) ! {1, 2, . . . , k} be a function. 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) 6 1, i, j 2 {1, 2, . . . , k} and ef (0) − ef (1) 6 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 admits a k-prime cordial labeling is called a k-prime cordial graph. In this paper we investigate 4-prime cordial labeling
behavior of union of two bipartite graphs, union of trees, durer graph, tietze graph, planar grid Pm × Pn, subdivision of wheels and subdivision of helms.