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

Abstract : 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.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [29 references]  Display  Hide  Download

https://hal.inria.fr/hal-00961106
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Wednesday, March 19, 2014 - 2:31:05 PM
Last modification on : Wednesday, November 29, 2017 - 10:26:22 AM
Document(s) archivé(s) le : Thursday, June 19, 2014 - 11:58:31 AM

File

dm080109.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00961106, version 1

Collections

Citation

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

Share

Metrics

Record views

107

Files downloads

352