Ir al contenido

Documat


Odd harmonious labeling of grid graphs

  • Jeyanthi, P. [2] ; Philo, S. [1] ; Youssef, Maged Z. [3]
    1. [1] Manonmaniam Sundaranar University

      Manonmaniam Sundaranar University

      India

    2. [2] Govindammal Aditanar College for Women.
    3. [3] Imam Mohammad Ibn Saud Islamic University.
  • Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 38, Nº. 3, 2019, págs. 411-428
  • Idioma: inglés
  • DOI: 10.22199/issn.0717-6279-2019-03-0027
  • Enlaces
  • Resumen
    • A graph G(p, q) is said to be odd harmonious if there exists an injection f : V (G) → {0, 1, 2, · · · , 2q − 1} such that the induced function f* : E(G) → {1, 3, · · · , 2q − 1} defined by f∗ (uv) = f (u) + f (v) is a bijection. In this paper we prove that path union of t copies of Pm×Pn, path union of t different copies of Pmᵢ×Pnᵢ where 1 ≤ i ≤ t, vertex union of t copies of Pm×Pn, vertex union of t different copies of Pmᵢ×Pnᵢ where 1 ≤ i ≤ t, one point union of path of Ptn (t.n.Pm×Pm), t super subdivision of grid graph Pm×Pn are odd harmonious graphs.

  • Referencias bibliográficas

Fundación Dialnet

Mi Documat

Opciones de artículo

Opciones de compartir

Opciones de entorno