Resumen

OLAYIDE AJAYI, Deborah  y  ADEFOKUN, Charles. L(1,1)-Labeling of Direct Product of any Path and Cycle. Proyecciones (Antofagasta) [online]. 2014, vol.33, n.4, pp.369-388. ISSN 0716-0917.  http://dx.doi.org/10.4067/S0716-09172014000400002.

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 Xⁱ^-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 P_m X P_n and P_m X C_n graphs for all m,n > 2.

Palabras clave : L(1,1)-labeling; D-2 Coloring; Direct Product of Graphs; Cross Product of Graphs; Path and Cycle..

        · texto en Inglés     · Inglés ( pdf )