3-product cordial labeling of some snake graphs.

• 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º. 1, 2019, págs. 13-30
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • Let G be a (p,q) graph. A mapping f : V (G) → {0, 1, 2} is called 3-product cordial labeling if |v????(i) − v???? (j)| ≤ 1 and |e???? (i) − e???? (j)| ≤ 1 for any i, j ∈ {0, 1, 2},where v???? (i) denotes the number of vertices labeled with i, e???? (i) denotes the number of edges xy with ????(x)????(y) ≡ i(mod3). A graph with 3-product cordial labeling is called 3-product cordial graph. In this paper we investigate the 3-product cordial behavior of alternate triangular snake, double alternate triangular snake and triangular snake graphs.