Published June 12, 2018 | Version v1
Journal article Open

3-PRIME CORDIAL LABELING OF SOME CYCLE RELATED SPECIAL GRAPHS

Authors/Creators

  • 1. *1Research Scholar, Department of Mathematics, Manonmanium Sundaranar University, Abishekapatti, Tirunelveli-627012. Tamilnadu, India 2Assistant Professor, Department of Mathematics, Sri Paramakalyani College, Alwarkurichi-627412,Tamilnadu, India 3Professor, Department of Mathematics, Manonmanium Sundaranar University, Abishekapatti, Tirunelveli-627012. Tamilnadu, India

Description

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) | ≤ 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 the number of edges labeled with 1 and not labeled with 1. A graph which admits a k-prime cordial labeling is called a k-prime cordial graph. In this paper, we investigate the 3-prime cordial labeling behaviour of some triangular snake graphs and diamond snake graphs..

Files

Files (142.5 kB)

Name Size Download all
md5:b3dc512a47a54aea8fd9b2b19200bbb6
142.5 kB Download