A General Approach to L ( h, k )-Label Interconnection Networks

d Abstract) Tiziana Calamoneri 1 , Saverio Caminiti 2 , and Rossella Petreschi 3 Dipartimento di Informatica Universit`a degli Studi di Roma "La Sapienza" Via Salaria 113, 00198 Rome, Italy Given two non negative integers h and k, an L(h, k)-labeling of a graph G = (V, E) is a function from the set V to a set of colors, such that adjacent nodes take colors at distance at least h and nodes at distance 2 take colors at distance at least k. The aim of the L(h, k)-labeling problem is to minimize the greatest used color. Since the decisional version of this problem is NP-complete, it is important to investigate particular classes of graphs for which the problem can be efficiently solved. In this work the L(h, k)-labeling problem for a new class of graphs, called (l

• Type: Journal
• Year: 2008
• Where: JCST
• Authors: Tiziana Calamoneri, Saverio Caminiti, Rossella Petreschi
• Keywords: JCST 2008, Non Negative Integers, Saverio Caminiti, Tiziana Calamoneri