Labeling trees with a condition at distance two

An L(h, k)-labeling of a graph G is an integer labeling of vertices of G, such that adjacent vertices have labels which differ by at least h, and vertices at distance two have labels which differ by at least k. The span of an L(h, k)-labeling is the difference between the largest and the smallest label. We investigate L(h, k)-labelings of trees of maximum degree , seeking those with small span. Given , h and k, span is optimal for the class of trees of maximum degree , if is the smallest integer such that every tree of maximum degree has an L(h, k)-labeling with span at most . For all parameters , h, k, such that h < k, we construct L(h, k)-labelings with optimal span. We also establish optimal span of L(h, k)-labelings for stars of arbitrary degree and all values of h and k. Key words: tree, vertex labeling, L(h, k)-labeling, maximum degree Dipartimento di Informatica, Universit`a degli Studi di Roma "La Sapienza", 00198 Roma, Italy.

• Type: Journal
• Year: 2006
• Where: DM
• Authors: Tiziana Calamoneri, Andrzej Pelc, Rossella Petreschi
• Keywords: Adjacent Vertices, DM 2006, Label, Maximum Degree