Show simple item record

dc.creatorJeyanthi, P.
dc.creatorPhilo, S.
dc.creatorYoussef, Maged Z.
dc.date2019-08-06
dc.date.accessioned2019-09-11T12:05:55Z
dc.date.available2019-09-11T12:05:55Z
dc.identifierhttp://www.revistaproyecciones.cl/article/view/3696
dc.identifier10.22199/issn.0717-6279-2019-03-0027
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/108851
dc.descriptionA 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.en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad Católica del Norte.es-ES
dc.relationhttp://www.revistaproyecciones.cl/article/view/3696/3213
dc.rightsDerechos de autor 2019 P. Jeyanthi, S. Philo, Maged Z. Youssefes-ES
dc.rightshttp://creativecommons.org/licenses/by/4.0es-ES
dc.sourceProyecciones. Journal of Mathematics; Vol 38 No 3 (2019); 411-428en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 38 Núm. 3 (2019); 411-428es-ES
dc.source0717-6279
dc.source0716-0917
dc.titleOdd harmonious labeling of grid graphsen-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typeArtículo revisado por pareses-ES
dc.typetexten-US


This item appears in the following Collection(s)

Show simple item record