Ayuda
Ir al contenido

Dialnet


Analytic odd mean labeling of union and identification of some graphs

    1. [1] Chinese University of Hong Kong

      Chinese University of Hong Kong

      RAE de Hong Kong (China)

    2. [2] Govindammal Aditanar College for Women.
  • Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 42, Nº. 5, 2023, págs. 1141-1155
  • Idioma: inglés
  • Enlaces
  • Resumen
    • A graph G is analytic odd mean if there exist an injective function f  : V → {0, 1, 3, . . . , 2q − 1} with an induced edge labeling f∗ : E → Z such that for each edge uv with f(u) < f(v), is injective. Clearly the values of f∗ are odd. We say that f is an analytic odd mean labeling of G. In this paper, we show that the union and identification of some graphs admit analytic odd mean labeling by using the operation of joining of two graphs by an edge.


Fundación Dialnet

Dialnet Plus

  • Más información sobre Dialnet Plus

Opciones de compartir

Opciones de entorno