Korean Journal of Mathematics

The Kangwon-Kyungki Mathematical Society (강원경기수학회)
권호 표지
DOI QR코드

DOI QR Code

OPTIMAL RADIOCOLORING OF TREES

  • Zhang, Xiaoling (College of Mathematics and Computer Science Quanzhou Normal University)
  • Received : 20181131
  • Accepted : 2019.11.26
  • Published : 2019.12.30
Download PDF
⟨ Previous Next ⟩

Abstract

A Radiocoloring (RC) of a graph G is a function f from the vertex set V (G) to the set of all non-negative integers (labels) such that |f(u) - f(v)| ≥ 2 if d(u, v) = 1 and |f(u) - f(v)| ≥ 1 if d(u, v) = 2. The number of discrete labels and the range of labels used are called order and span, respectively. In this paper, we concentrate on the minimum order span Radiocoloring Problem (RCP) of trees. The optimization version of the minimum order span RCP that tries to find, from all minimum order assignments, one that uses the minimum span. We provide attainable lower and upper bounds for trees. Moreover, a complete characterization of caterpillars (as a subclass of trees) with the minimum order span is given.

Keywords

References

  1. W.K. Hale, Frequency assignment: Theory and applications, Proc. IEEE 68 (1980), 1497-1514. https://doi.org/10.1109/PROC.1980.11899
  2. J.R. Griggs and R.K. Yeh, Labelling graphs with a condition at distance 2, SIAM J. Discrete Math. 5 (1992), 586-595. https://doi.org/10.1137/0405048
  3. G.J. Chang and D. Kuo, The L(2; 1)-labeling problem on graphs, SIAM J. Discrete Math. 9 (1996), 309-316. https://doi.org/10.1137/S0895480193245339
  4. J.P. Georges and D.W. Mauro, Labeling trees with a condition at distance two, Discrete Math. 269 (2003), 127-148. https://doi.org/10.1016/S0012-365X(02)00750-1
  5. W.F. Wang, The L(2; 1)-labelling of trees, Discrete Appl. Math. 154 (2007), 598-603. https://doi.org/10.1016/j.dam.2005.09.007
  6. R.K. Yeh, A survey on labeling graphs with a condition at distance two, Discrete Math. 306 (2006), 1217-1231. https://doi.org/10.1016/j.disc.2005.11.029
  7. T. Calamoneri, The L(h; k)-labelling problem: an updated survey and annotated bibliography, Comput. J. 54 (2011), 1344-1371. https://doi.org/10.1093/comjnl/bxr037
  8. D.A. Fotakis, S.E. Nikoletseas, V.G. Papadopoulou and P.G. Spirakis, Radio-coloring in planar graphs: Complexity and approximations, Theo. Comput. Sci. 340 (2005), 514-538. https://doi.org/10.1016/j.tcs.2005.03.013
  9. D.A. Fotakis, S.E. Nikoletseas, V.G. Papadopoulou and P.G. Spirakis, NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs, In: Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes of Computer Science, vol. 1893, pp. 363-372. Springer (2000).
  10. J. Griggs and D. Liu, Minimum span channel assignments, Recent Advances in Radio Channel Assignments, Invited Minisymposium, Discrete Math. (1998).
  11. Y.L. Lin and S. Skiena, Algorithms for square roots of graphs, SIAM J. Discrete Math. 8 (1995), 99-118. https://doi.org/10.1137/S089548019120016X
  12. K.W. Lih and W.F. Wang, Coloring the square of an outerplanar graph, Taiwanese J. Math. 10 (4) (2006), 1015-1023. https://doi.org/10.11650/twjm/1500403890