dc.creator | Jeyanthi, P. | |
dc.creator | Philo, S. | |
dc.date | 2017-03-23 | |
dc.date.accessioned | 2019-11-14T11:59:10Z | |
dc.date.available | 2019-11-14T11:59:10Z | |
dc.identifier | https://www.revistaproyecciones.cl/article/view/1236 | |
dc.identifier | 10.4067/S0716-09172016000100006 | |
dc.identifier.uri | https://revistaschilenas.uchile.cl/handle/2250/113027 | |
dc.description | 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. | es-ES |
dc.format | application/pdf | |
dc.language | spa | |
dc.publisher | Universidad Católica del Norte. | es-ES |
dc.relation | https://www.revistaproyecciones.cl/article/view/1236/949 | |
dc.rights | Derechos de autor 2016 Proyecciones. Journal of Mathematics | es-ES |
dc.source | Proyecciones. Journal of Mathematics; Vol 35 No 1 (2016); 85-98 | en-US |
dc.source | Proyecciones. Revista de Matemática; Vol. 35 Núm. 1 (2016); 85-98 | es-ES |
dc.source | 0717-6279 | |
dc.source | 0716-0917 | |
dc.subject | Harmonious labeling | es-ES |
dc.subject | odd harmonious labeling | es-ES |
dc.subject | odd harmonious graph | es-ES |
dc.subject | strongly odd harmonious labeling | es-ES |
dc.subject | strongly odd harmonious graph | es-ES |
dc.subject | etiquetado armonioso | es-ES |
dc.subject | etiquetado armonioso impar | es-ES |
dc.subject | grafo armonioso impar. | es-ES |
dc.title | Odd harmonious labeling of some cycle related graphs | es-ES |
dc.type | info:eu-repo/semantics/article | |
dc.type | info:eu-repo/semantics/publishedVersion | |
dc.type | Artículo revisado por pares | es-ES |