L (j, k)-labelling and maximum ordering-degrees for trees

Discrete Applied Mathematics

Volumn 158, Issue 6, 2010, Pages 692-698

  Juan, Justie Su Tzu ^a   Liu, Daphne Der Fen ^b   Chen, Li Yueh ^a  

^a NATIONAL CHI NAN UNIVERSITY   (Taiwan)

^b CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

Channel assignment problem; Distance two labelling; Trees

Indexed keywords

CHANNEL ASSIGNMENT PROBLEM; INFINITE TREES; LOWER BOUNDS; MAXIMUM DEGREE; NEW PARAMETERS; POSITIVE INTEGERS; UPPER AND LOWER BOUNDS;

LIGHT MEASUREMENT;

TRAVELING SALESMAN PROBLEM;

EID: 76549104583     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2009.11.018     Document Type: Article

References (19)

1. Calamoneri T. The L (h, k)-labelling problem: A survey and annotated bibliography. Comput. J. 49 (2006) 585-608
2. Calamoneri T., and Petreschi R. L (h, 1)-labeling subclasses of planar graphs. J. Parallel Distrib. Comut. 64 (2004) 414-426
3. Chang G.J., and Lu C. Distance-two labelings of graphs. Europ. J. Combin. 24 (2003) 53-58
4. Chang G.J., and Kuo D. The L (2, 1)-labeling problem on graphs. SIAM J. Discrete Math. 9 (1996) 309-316
5. Chang G.J., Ke W., Kuo D., Liu D., and Yeh R. On L (d, 1)-labelings of graphs. Discrete Math. 220 (2000) 57-66
6. J. Fiala, P.A. Golovach, J. Kratochvil, Computational complexity of the distance constrained labeling problem for trees, in: 35th Intl. Colloquium on Automata, Languages and Programming, ICALP'08, in: LNCS, vol. 5125, Reykjavik, Iceland, 6-13 July, 2008, pp. 294-305
7. Furedi Z., Griggs J., and Kleitman D. Pair labellings with given distance. SIAM J. Discrete Math. 4 (1989) 491-499
8. Georges J., and Mauro D. Generalized vertex labelings with a condition at distance two. Congr. Number. 109 (1995) 141-159
9. Georges J., and Mauro D. Labeling trees with a condition at distance two. Discrete Math. 269 (2003) 127-148
10. n and related graphs. SIAM J. Discrete Math. 8 (1995) 499-506
11. Griggs J., and Jin X. Real number graph labellings with distance conditions. SIAM J. Discrete Math. 20 (2006) 302-327
12. Griggs J., and Jin X. Real number channel assignments for lattices. SIAM J. Discrete Math. 22 (2008) 996-1021
13. Griggs J., and Yeh R. Labeling graphs with a condition at distance 2. SIAM J. Discrete Math. 5 (1992) 586-595
14. Hale W. Frequency assignment: Theory and applications. Proc. IEEE 68 (1980) 1497-1514
15. Jha P. Optimal L (2, 1)-labeling of strong products of cycles. IEEE Trans. Circuits Systems I: Fund. Theory Appl. 48 (2001) 498-500
16. Liu D., and Yeh R. On distance two labelings of graphs. Ars Combin. 47 (1997) 13-22
17. Molloy M., and Salavatipour M.R. A bound on the chromatic number of the square of a planar graph. J. Combin. Theory (Ser. B) 94 (2005) 189-213
18. Sakai D. Labeling chordal graphs with a condition at distance two. SIAM J. Discrete Math. 7 (1994) 133-140
19. Yeh R. A survey on labeling graphs with a condition at distance two. Discrete Math. 306 (2006) 1217-1231