SciELO - Scientific Electronic Library Online

vol.35 issue1The forcing open monophonic number of a graphCoupled lower and upper solution approach for the existence of Solutions of nonlinear coupled system with nonlinear coupled boundary conditions author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand




Related links

  • On index processCited by Google
  • Have no similar articlesSimilars in SciELO
  • On index processSimilars in Google


Proyecciones (Antofagasta)

Print version ISSN 0716-0917


JEYANTHI, P.  and  PHILO, S.. Odd harmonious labeling of some cycle related graphs. Proyecciones (Antofagasta) [online]. 2016, vol.35, n.1, pp.85-98. ISSN 0716-0917.

A graph G(p, q) is said to be odd harmonious if there exists an in-jection 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. A graph that admits odd harmonious labeling is called odd harmonious graph. In this paper we prove that any two even cycles sharing a common vertex and a common edge are odd harmonious graphs.

Keywords : Harmonious labeling; odd harmonious labeling; odd harmonious graph; strongly odd harmonious labeling; strongly odd harmonious graph.

        · text in English     · English ( pdf )


Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License