Labelling of Cactus Graphs

The -labelling of a graph is an abstraction of assigning integer frequencies to radio transmitters such that the transmitters that are one unit of distance apart receive frequencies that differ by at least two, and transmitters that are two units of distance apart receive frequencies that differ by at least one. The span of an -labelling is the difference between the largest and the smallest assigned frequency. The -labelling number of a graph , denoted by , is the least integer such that has an -labelling of span . A cactus graph is a connected graph in which every block is either an edge or a cycle. The goal of the problem is to show that for a cactus graph , where is the degree of . An optimal algorithm is also presented here to label the vertices of cactus graph using -labelling technique in time, where is the total number of vertices of the cactus graph.

[1]  Jan van den Heuvel,et al.  Coloring the square of a planar graph , 2003 .

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

[3]  John P. Georges,et al.  On generalized Petersen graphs labeled with a condition at distance two , 2002, Discret. Math..

[4]  Ko-Wei Lih,et al.  Labeling Planar Graphs with Conditions on Girth and Distance Two , 2004, SIAM J. Discret. Math..

[5]  John P. Georges,et al.  On the lambda-Number of Qn and Related Graphs , 1995, SIAM J. Discret. Math..

[6]  John P. Georges,et al.  On Regular Graphs Optimally Labeled with a Condition at Distance Two , 2004, SIAM J. Discret. Math..

[7]  Daphne Der-Fen Liu,et al.  On Distance Two Labellings of Graphs , 1997, Ars Comb..

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

[9]  Mohammad R. Salavatipour,et al.  A bound on the chromatic number of the square of a planar graph , 2005, J. Comb. Theory, Ser. B.

[10]  Jing-Ho Yan,et al.  On L(d, 1)-labeling of Cartesian product of a cycle and a path , 2008, Discret. Appl. Math..

[11]  Sarah Spence Adams,et al.  The minimum span of L(2, 1)-labelings of certain generalized Petersen graphs , 2007, Discret. Appl. Math..

[12]  Daniel Král,et al.  A Theorem about the Channel Assignment Problem , 2003, SIAM J. Discret. Math..

[13]  John P. Georges,et al.  Relating path coverings to vertex labellings with a condition at distance two , 1994, Discret. Math..

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