A survey on labeling graphs with a condition at distance two

Discrete Mathematics

Volumn 306, Issue 12, 2006, Pages 1217-1231

  Yeh, Roger K ^a  

^a FENG CHIA UNIVERSITY   (Taiwan)

Author keywords

Code assignment; Graph labeling

Indexed keywords

COMPUTER NETWORKS; NUMBER THEORY; PROBLEM SOLVING; SET THEORY;

CODE ASSIGNMENT; GRAPH LABELING; LABELINGS;

GRAPH THEORY;

EID: 33747032334     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2005.11.029     Document Type: Article

References (59)

1. Agnarsson G., Greenlaw R., and Halldorsson M.M. On powers of chordal graphs and their colorings. Congr. Numer. 144 (2000) 41-65
2. Battiti R., Bertossi A.A., and Cavallaro D. A randomized saturation-degree heuristic for channel assignment in cellular radio networks. IEEE Trans. Vehicular Tech. 50 (2001) 364-374
3. Bertossi A.A., and Bonuccelli M.A. Code assignment for hidden terminal interference avoidance in multihop packet radio networks. IEEE/ACM Trans. Networking 3 (1995) 441-449
4. A.A. Bertossi, M.C. Pinotti, R. Rizzi, Channel assignment on strongly-simplicial graphs, IEEE Proceedings of the International Parallel and Distribution Processing Symposium, 2003.
5. Bertossi A.A., Pinotti M.C., and Tan R.B. Channel assignment with separation for interference avoidance in wireless networks. IEEE Trans. Parallel Distrib. Systems 14 (2003) 222-235
6. H.L. Bodlaender, T. Kloks, R.B. Tan, J.V. Leeuwen, λ-coloring of graphs, Lecture Notes in Computer Science, vol. 1770, Springer, Berlin, Heidelberg, 2000, pp. 395-406.
7. Bollobás B. Extremal Graph Theory (1978), Academic Press, London
8. Bondy J.A., and Murty U.S.R. Graph Theory with Applications (1976), North-Holland, New York
9. T. Calamoneri, A. Pelc, R. Petreschi, Labeling trees with a condition at distance two, Discrete Math., to appear.
10. Calamoneri T., and Petreschi R. L ( h, 1 )-labeling subclasses of planar graphs. J. Parallel Distrib. Comput. 64 (2004) 414-426
11. Chang G.J., Ke W.-T., Kuo D., Liu D.D.-F., and Yeh R.K. On L ( d, 1 )-labelings of graphs. Discrete Math. 220 (2000) 57-66
12. Chang G.J., and Kuo D. The L ( 2, 1 )-labeling on graphs. SIAM J. Discrete Math. 9 (1996) 309-316
13. Chang G.J., and Liaw S.-C. The L ( 2, 1 )-labeling problem on ditrees. Ars Combin. 66 (2003) 23-31
14. Chang G.J., and Lu C. Distance-two labelings of graphs. European J. Combin. 24 (2003) 53-58
15. Y.-S. Chen, A study on graph labellings with two levels of constraint, Master Thesis, Department of Applied Mathematics, Feng Chia University, Taichung, Taiwan, 2000.
16. S.-H. Chiang, On L ( d, 1 )-labeling of Cartesian product of a cycle and a path, Master Thesis, Department of Mathematics, Aletheia University, Tamsui, Taipei, Taiwan, 2004.
17. Erwin D.J., Georges J.P., and Mauro D.W. On labeling the vertices of products of complete graphs with distance constraints. Naval Res. Logist. 52 (2005) 138-144
18. J. Fiala, T. Kloks, J. Kratochíl, Fixed-parameter complexity of λ-labelings, in: Lecture Notes in Computer Science, vol. 1665, Springer, Berlin, 1999, pp. 350-363.
19. P.C. Fishburn, F.S. Roberts, Full color theorems for L ( 2, 1 )-colorings, DIMACS Technical Report 2000-08, 2000.
20. P.C. Fishburn, F.S. Roberts, Minimum forbidden graphs for L ( 2, 1 )-colorings, DIMACS Technical Report 2000-32, 2000.
21. Fishburn P.C., and Roberts F.S. No-hole L ( 2, 1 )-colorings. Discrete Appl. Math. 130 (2003) 513-519
22. Georges J., and Mauro D.W. On the criticality of graphs labelled with a condition at distance two. Congr. Numer. 101 (1994) 33-49
23. Georges J., and Mauro D.W. Generalized vertex labelings with a condition at distance two. Congr. Numer. 109 (1995) 141-159
24. Georges J., and Mauro D.W. On the size of graphs labeled with a condition at distance two. J. Graph Theory 22 (1996) 47-57
25. j-numbers of the products of complete graphs. Congr. Numer. 140 (1999) 141-160
26. Georges J.P., and Mauro D.W. On generalized Petersen graphs labeled with a condition at distance two. Discrete Math. 259 (2003) 311-318
27. Georges J.P., and Mauro D.W. Labeling trees with a condition at distance two. Discrete Math. 269 (2003) 127-148
28. J.P. Georges, D.W. Mauro, On regular graphs optimally labeled with a condition at distance two, SIAM J. Discrete Math. (2003) 320-331.
29. Georges J.P., Mauro D.W., and Stein M.I. Labeling products of complete graphs with a condition at distance two. SIAM J. Discrete Math. 14 (2000) 28-35
30. Georges J., Mauro D.W., and Whittlesey M. Relating path covering to vertex labelings with a condition at distance two. Discrete Math. 135 (1994) 103-111
31. Gerke S. Coloring weighted bipartite graphs with co-site constraint. Discrete Math. 224 (2004) 125-138
32. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs (1980), Academic Press, New York
33. Griggs J.R., and Yeh R.K. Labeling graphs with a condition at distance two. SIAM J. Discrete Math. 5 (1992) 586-595
34. van den Heuvel J., Leese R.A., and Shepherd M.A. Graph labeling and radio channel assignment. J. Graph Theory 29 (1998) 263-283
35. 2.5 ) algorithm for maximum matching in bipartite graphs. SIAM J. Comput. 2 (1973) 225-231
36. Jha P.K. Optimal L ( 2, 1 )-labeling of Cartesian products of cycles with an application to independent domination. IEEE Trans. Circuits and Systems-I 47 (2000) 1531-1534
37. Jha P.K. Optimal L ( 2, 1 )-labeling of strong products of cycles. IEEE Trans. Circuits and Systems-I 48 (2001) 498-500
38. Jha P.K., Narayanan A., Sood P., Sundaram K., and Sunder V. On L ( 2, 1 )-labeling of the Cartesian product of a cycle and a path. Ars Combin. 55 (2000) 81-89
39. X.T. Jin, Real number graph labeling with distance conditions, Ph.D. Thesis, Department of Mathematics, University of South Carolina, Columbia, SC, USA, 2005.
40. Jin X.T., and Yeh R.K. Graph distance-dependent labeling related to code assignment in computer networks. Naval Res. Logist. 52 (2005) 159-164
41. K. Jonas, Graph colorings analogues with a condition at distance two: L ( 2, 1 )-labelings and list λ-labelings, Ph.D. Thesis, Department of Mathematics University of South Carolina, Columbia, SC, USA, 1993.
42. Kárteszi F. Introduction to Finite Geometries (1976), North-Holland, New York
43. Klavžar S., and Vesel A. Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2,1)-colorings and independence numbers. Discrete Appl. Math. 129 (2003) 449-460
44. Král' D., and Škrekovski R. A theorem about channel assignment problem. SIAM J. Discrete Math. 16 (2003) 426-437
45. Kuo D., and Yan J.-H. On L ( 2, 1 )-labeling of Cartesian products of paths and cycles. Discrete Math. 283 (2004) 137-144
46. Liu D.D.-F. Hamiltonicity and circular distance two labellings. Discrete Math. 232 (2001) 163-169
47. Liu D.D.-F., and Yeh R.K. On distance-two labelings of graphs. Ars Combin. 47 (1997) 13-22
48. D.D.-F. Liu, X. Zhu, Circulant distant two labeling and circular chromatic number, manuscript.
49. Sakai D. Labeling chordal graphs with a condition at distance two. SIAM J. Discrete Math. 7 (1994) 133-140
50. Shao Z.-D., and Yeh R.K. The L ( 2, 1 )-labeling and operations of graphs. IEEE Trans. Circuits and Systems-I 52 (2005) 668-671
51. M.V.S. Shashanka, A. Pati, A.M. Shende, A characterization of optimal channel assignments for wireless networks modelled as cellular and square grids, IEEE Proceedings of the International Parallel and Distribution Processing Symposium, 2003.
52. Wang W.-F., and Lih K.-W. Labeling planar graphs with conditions on girth and distance two. SIAM J. Discrete Math. 17 (2003) 264-275
53. West D.B. Introduction to Graph Theory. second ed. (2001), Prentice-Hall, Englewood cliffs, NJ
54. n and related graphs. SIAM J. Discrete Math. 8 (1995) 499-506
55. Wu K.-F., and Yeh R.K. Labeling graphs with the circular difference. Taiwanese J. Math. 4 (2000) 397-405
56. D.-F. Yang, Algorithmic aspect of the L ( d, 1 )-labeling on trees: revisited, Master Thesis, Department of Applied Mathematics, Feng Chia University, Taichung, Taiwan, 1998.
57. R.K. Yeh, Labeling graphs with a condition at distance two, Ph.D. Thesis, Department of Mathematics, University of South Carolina, 1990.
58. Yeh R.K. The edge span of distance two labelings of graphs. Taiwanese J. Math. 4 (2000) 675-683
59. Zhou X., Kanari Y., and Nishizeki T. Generalized vertex colorings of partial k-trees. IEICE Trans. Fundamentals E83-A (2000) 671-678