JOURNAL BROWSE
Search
Advanced SearchSearch Tips
k-PRIME CORDIAL GRAPHS
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
k-PRIME CORDIAL GRAPHS
PONRAJ, R.; SINGH, RAJPAL; KALA, R.; NARAYANAN, S. SATHISH;
 
 Abstract
In this paper we introduce a new graph labeling called k-prime cordial labeling. Let G be a (p, q) graph and 2 ≤ p ≤ k. 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 a 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 the k-prime cordial labeling behavior of a star and we have proved that every graph is a subgraph of a k-prime cordial graph. Also we investigate the 3-prime cordial labeling behavior of path, cycle, complete graph, wheel, comb and some more standard graphs.
 Keywords
Path;Cycle;Complete graph;Wheel;Star;
 Language
English
 Cited by
 References
1.
I. Cahit, Cordial Graphs: A weaker version of Graceful and Harmonious graphs, Ars combin., 23 (1987) 201-207.

2.
J.A. Gallian, A Dynamic survey of graph labeling, The Electronic Journal of Combinatorics, 17 (2014) #Ds6.

3.
F. Harary, Graph theory, Addision wesley, New Delhi, 1969.

4.
R. Ponraj, M. Maria Adaickalam and R. Kala, k-difference cordial labeling of graphs, (communicated).

5.
M.A. Seoud and M.A. Salim, Two upper bounds of prime cordial graphs, JCMCC, 75 (2010) 95-103.

6.
M.A. Seoud and M.A. Salim, Upper bounds of four types of graph labelings, preprint.

7.
M. Sundaram, R. Ponraj and S. Somasundaram, Prime cordial labeling of graphs, J. Indian Acad. Math., 27 (2005) 373-390.