L(2, 1)-Labeling of Unigraphs - (Extended Abstract)

The L(2, 1)-labeling problem consists of assigning colors from the integer set 0, ..., λ to the nodes of a graph G in such a way that nodes at a distance of at most two get different colors, while adjacent nodes get colors which are at least two apart. The aim of this problem is to minimize λ and it is in general NP-complete. In this paper the problem of L(2, 1)-labeling unigraphs, i.e. graphs uniquely determined by their own degree sequence up to isomorphism, is addressed and a 3/2-approximate algorithm for L(2, 1)-labeling unigraphs is designed. This algorithm runs in O(n) time, improving the time of the algorithm based on the greedy technique, requiring O(m) time, that may be near to Θ(n2) for unigraphs.

[1]  Rossella Petreschi,et al.  Recognition of Unigraphs through Superposition of Graphs (Extended Abstract) , 2009, WALCOM.

[2]  Denise Sakai,et al.  Labeling Chordal Graphs: Distance Two Condition , 1994 .

[3]  Jan Kratochvíl,et al.  Fixed-parameter complexity of lambda-labelings , 2001, Discret. Appl. Math..

[4]  Stephan Olariu,et al.  On the L(h, k)-labeling of co-comparability graphs and circular-arc graphs , 2009 .

[5]  Gerard J. Chang,et al.  The L(2, 1)-Labeling Problem on Graphs , 1996, SIAM J. Discret. Math..

[6]  Jan van Leeuwen,et al.  lambda-Coloring of Graphs , 2000, STACS.

[7]  Toru Araki,et al.  Labeling bipartite permutation graphs with a condition at distance two , 2009, Discret. Appl. Math..

[8]  Rossella Petreschi,et al.  Recognition of Unigraphs through Superposition of Graphs , 2011, J. Graph Algorithms Appl..

[9]  R. H. Johnson.  Simple separable graphs , 1975 .

[10]  N. Mahadev,et al.  Threshold graphs and related topics , 1995 .

[11]  Tiziana Calamoneri,et al.  The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography , 2006, Comput. J..

[12]  Regina Tyshkevich,et al.  Decomposition of graphical sequences and unigraphs , 2000, Discret. Math..

[13]  S. Li.  Graphic sequences with unique realization , 1975 .

[14]  Rossella Petreschi,et al.  L(h, 1)-labeling subclasses of planar graphs , 2004, J. Parallel Distributed Comput..

[15]  Rossella Petreschi,et al.  lambda-Coloring matrogenic graphs , 2006, Discret. Appl. Math..

[16]  Jerrold R. Griggs,et al.  Labelling Graphs with a Condition at Distance 2 , 1992, SIAM J. Discret. Math..