Odd harmonious labeling of some cycle related graphs

dc.creator	Jeyanthi, P.	es
dc.creator	Philo, S.	es
dc.date	2017-03-23
dc.date.accessioned	2025-10-06T15:04:53Z
dc.date.available	2025-10-06T15:04:53Z
dc.identifier	https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1236
dc.identifier	10.4067/S0716-09172016000100006
dc.identifier.uri	https://revistaschilenas.uchile.cl/handle/2250/255406
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
dc.format	application/pdf
dc.language	spa
dc.publisher	Universidad Católica del Norte.	en
dc.relation	https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1236/949
dc.rights	Copyright (c) 2016 Proyecciones. Journal of Mathematics	en
dc.rights	https://creativecommons.org/licenses/by/4.0	en
dc.source	Proyecciones (Antofagasta); Vol. 35 No. 1 (2016); 85-98	en
dc.source	Proyecciones. Revista de Matemática; Vol. 35 Núm. 1 (2016); 85-98	es
dc.source	0717-6279
dc.source	10.22199/issn.0717-6279-2016
dc.title	Odd harmonious labeling of some cycle related graphs	es
dc.type	info:eu-repo/semantics/article
dc.type	info:eu-repo/semantics/publishedVersion