Show simple item record

dc.creatorOlayide Ajayi, Deborah
dc.creatorAdefokun, Charles
dc.date2017-03-23
dc.date.accessioned2019-11-14T11:59:13Z
dc.date.available2019-11-14T11:59:13Z
dc.identifierhttps://www.revistaproyecciones.cl/article/view/1269
dc.identifier10.4067/S0716-09172014000400002
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/113060
dc.descriptionSuppose that [n] = {0, 1, 2,...,n} is a set of non-negative integers and h,k G [n].The L (h, k)-labeling of graph G is the function l : V(G) — [n] such that |l(u) — l(v)| > h if the distance d(u,v) between u and v is 1 and |l(u) — l(v)| > k if d(u,v) = 2. Let L(V(G)) = {l(v): v G V(G)} and let p be the maximum value of L(V(G)). Then p is called Xi^—number of G if p is the least possible member of [n] such that G maintains an L(h, k) — labeling. In this paper, we establish X} — numbers of Pm X Pn and Pm X Cn graphs for all m,n > 2.es-ES
dc.formatapplication/pdf
dc.languagespa
dc.publisherUniversidad Católica del Norte.es-ES
dc.relationhttps://www.revistaproyecciones.cl/article/view/1269/981
dc.rightsDerechos de autor 2014 Proyecciones. Journal of Mathematicses-ES
dc.sourceProyecciones. Journal of Mathematics; Vol 33 No 4 (2014); 369-388en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 33 Núm. 4 (2014); 369-388es-ES
dc.source0717-6279
dc.source0716-0917
dc.subjectL(1es-ES
dc.subject1)-labelinges-ES
dc.subjectD-2 coloringes-ES
dc.subjectdirect product of graphses-ES
dc.subjectcross product of graphses-ES
dc.subjectpath and cyclees-ES
dc.subjectetiquetado L(1es-ES
dc.subject1)es-ES
dc.subjectcoloreado D-2es-ES
dc.subjectproducto directo de grafoses-ES
dc.subjectproducto cruz de grafoses-ES
dc.subjectrecorrido y ciclo.es-ES
dc.titleL(1,1)-Labeling of Direct Product of any Path and cyclees-ES
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typeArtículo revisado por pareses-ES


This item appears in the following Collection(s)

Show simple item record