3-difference cordiality of some corona graphs.

Ponraj, R. ^[2] ; Adaickalam, M. Maria ^[3] ; Kala, R. ^[1]
1. [1] Manonmaniam Sundaranar University
  
  Manonmaniam Sundaranar University
  
  India
2. [2] Sri Paramakalyani College.
3. [3] District Statistical office.
Mostrar afiliaciones +
Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 38, Nº. 1, 2019, págs. 83-96
Idioma: inglés
Enlaces
- Texto completo
Resumen
- Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map where k is an integer 2 ≤ k ≤ p. For each edge uv, assign the label |f (u) − f (v)|. f is called k-difference cordial labeling of G if |vf (i) − vf (j)| ≤ 1 and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the umber of vertices labelled with x, ef (1) and ef (0) respectively denote the number of edges labelled with 1 and not labelled with 1. A graph with a k-difference cordial labeling is called a k-difference cordial graph. In this paper we investigate 3-difference cordial labeling behavior of Tn ʘK1, Tn ʘ2K1, Tn ʘK2, A(Tn)ʘK1, A(Tn)ʘ 2K1, A(Tn) ʘ K2.