| dc.creator | Olayide Ajayi, Deborah | es |
| dc.creator | Adefokun, Charles | es |
| dc.date | 2017-03-23 | |
| dc.date.accessioned | 2025-10-06T15:04:55Z | |
| dc.date.available | 2025-10-06T15:04:55Z | |
| dc.identifier | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1269 | |
| dc.identifier | 10.4067/S0716-09172014000400002 | |
| dc.identifier.uri | https://revistaschilenas.uchile.cl/handle/2250/255439 | |
| dc.description | Suppose 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 |
| 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/1269/981 | |
| dc.rights | Copyright (c) 2014 Proyecciones. Journal of Mathematics | en |
| dc.rights | https://creativecommons.org/licenses/by/4.0 | en |
| dc.source | Proyecciones (Antofagasta); Vol. 33 No. 4 (2014); 369-388 | en |
| dc.source | Proyecciones. Revista de Matemática; Vol. 33 Núm. 4 (2014); 369-388 | es |
| dc.source | 0717-6279 | |
| dc.source | 10.22199/issn.0717-6279-2014 | |
| dc.title | L(1,1)-Labeling of Direct Product of any Path and cycle | es |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
