L(0,1)-labelling of Permutation Graphs

L(0,1)-labelling of a graph G=(V,E) is a function f from the vertex set V(G) to the set of non-negative integers such that adjacent vertices get number zero apart, and vertices at distance two get distinct numbers. The goal of L(0,1)-labelling problem is to produce a legal labelling that minimize the largest label used. In this article, it is shown that, for a permutation graph G with maximum vertex degree Δ, the upper bound of λ0,1(G) is Δ−1. Finally, we prove that the result is exact for bipartite permutation graph.

[1]  Qiaoling Ma,et al.  Labelling of some planar graphs with a condition at distance two , 2007 .

[2]  Madhumangal Pal,et al.  An Efficient Algorithm to Solve L(0,1)-Labelling Problem on Interval Graphs , 2013 .

[3]  Roger K. Yeh.  A survey on labeling graphs with a condition at distance two , 2006, Discret. Math..

[4]  Tarek Makansi,et al.  Transmitter-Oriented Code Assignment for Multihop Packet Radio , 1987, IEEE Trans. Commun..

[5]  Madhumangal Pal,et al.  An optimal algorithm for finding depth-first spanning tree on permutation graphs , 1999 .

[6]  Madhumangal Pal.  A parallel algorithm to generate all maximal independent sets on permutation graphs , 1998, Int. J. Comput. Math..

[7]  Tiziana Calamoneri,et al.  The L(h, k)-Labelling Problem: An Updated Survey and Annotated Bibliography , 2011, Comput. J..

[8]  G. Chang,et al.  Labeling graphs with a condition at distance two , 2005 .

[9]  Alan A. Bertossi,et al.  Code assignment for hidden terminal interference avoidance in multihop packet radio networks , 1995, TNET.

[10]  Charles B. Dunham,et al.  A survey of published programs for best approximation , 1979 .

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

[12]  Madhumangal Pal,et al.  An efficient pram algorithm for maximum-weight independent set on permutation graphs , 2005 .

[13]  Roger K. Yeh,et al.  Graph distance‐dependent labeling related to code assignment in computer networks , 2005 .

[14]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[15]  Gerard J. Chang,et al.  Distance-two labelings of graphs , 2003, Eur. J. Comb..

[16]  Jan van Leeuwen,et al.  Approximations for lambda-Colorings of Graphs , 2004, Comput. J..

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

[18]  Madhumangal Pal.  Efficient algorithms to compute all articulation points of a permutation graph , 1998 .

[19]  Madhumangal Pal,et al.  L(0, 1)-Labelling of Cactus Graphs , 2012 .

[20]  M. Golumbic.  Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .

[21]  Ten-Hwang Lai,et al.  Bipartite Permutation Graphs with Application to the Minimum Buffer Size Problem , 1997, Discret. Appl. Math..

[22]  M. Golumbic.  Chapter 3 - Perfect graphs , 2004 .

[23]  Jeremy P. Spinrad,et al.  Bipartite permutation graphs , 1987, Discret. Appl. Math..

[24]  Madhumangal Pal,et al.  An efficient algorithm to find next-to-shortest path on permutation graphs , 2009 .

[25]  Madhumangal Pal,et al.  Maximum weight k-independent set problem on permutation graphs , 2003, Int. J. Comput. Math..

[26]  Jan van Leeuwen,et al.  Approximations for λ-Colorings of Graphs 201 , 2004 .

[27]  W. K. Hale.  Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.

[28]  Madhumangal Pal,et al.  Labelling of Cactus Graphs , 2012 .

[29]  Madhumangal Pal,et al.  Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs , 2003, Int. J. Comput. Math..

[30]  Madhumangal Pal,et al.  L(2,1)-labeling of interval graphs , 2015, International Journal of Mathematics for Industry.

[31]  Madhumangal Pal,et al.  An Optimal Algorithm to Solve the All-Pairs Shortest Paths Problem on Permutation Graphs , 2003, J. Math. Model. Algorithms.

[32]  Madhumangal Pal,et al.  L(2, 1)-Labeling of Permutation and Bipartite Permutation Graphs , 2015, Math. Comput. Sci..

[33]  D. Gonçalves,et al.  On the L(p, 1)-labelling of graphs , 2008, Discret. Math..

[34]  Madhumangal Pal,et al.  (2,1)-Total Labelling of Cactus Graphs , 2010 .