Further results on 3-product cordial labeling.

• Jeyanthi, P. ^[1] ; Maheswari, A. ^[2] ; Vijayalakshmi, M. ^[3]
  1. [1] Govindammal Aditanar College for Women.
  2. [2] Kamaraj College of Engineering and Technology.
  3. [3] Dr. G. U. Pope College of Engineering.

  Mostrar afiliaciones +
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 38, Nº. 2, 2019, págs. 191-202
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • A mapping f : V (G) → {0, 1, 2} is called 3-product cordial labeling if |vf(i) − vf(j)| ≤ 1 and |ef(i) − ef(j)| ≤ 1 for any i, j ∈ {0, 1, 2}, where vf(i) denotes the number of vertices labeled with i, ef(i) denotes the number of edges xy with f(x)f(y) ≡ i(mod 3). A graph with 3-product cordial labeing is called 3-product cordial graph. In this paper we establish that switching of an apex vertex in closed helm, double fan, book graph K1,n × K2 and permutation graph P (K2 + mK1, I) are 3-product cordial graphs.