Optimal L(h,k)-Labeling of Regular Grids - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2006

Optimal L(h,k)-Labeling of Regular Grids

Résumé

The L(h, k)-labeling is an assignment of non negative integer labels to the nodes of a graph such that 'close' nodes have labels which differ by at least k, and 'very close' nodes have labels which differ by at least h. The span of an L(h,k)-labeling is the difference between the largest and the smallest assigned label. We study L(h, k)-labelings of cellular, squared and hexagonal grids, seeking those with minimum span for each value of k and h ≥ k. The L(h,k)-labeling problem has been intensively studied in some special cases, i.e. when k=0 (vertex coloring), h=k (vertex coloring the square of the graph) and h=2k (radio- or λ -coloring) but no results are known in the general case for regular grids. In this paper, we completely solve the L(h,k)-labeling problem on regular grids, finding exact values of the span for each value of h and k; only in a small interval we provide different upper and lower bounds.
Fichier principal
Vignette du fichier
dm080109.pdf (239.98 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00961106 , version 1 (19-03-2014)

Identifiants

Citer

Tiziana Calamoneri. Optimal L(h,k)-Labeling of Regular Grids. Discrete Mathematics and Theoretical Computer Science, 2006, Vol. 8, pp.141-158. ⟨10.46298/dmtcs.361⟩. ⟨hal-00961106⟩

Collections

TDS-MACS
75 Consultations
961 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More