Optimal radiocoloring of trees
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
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)|\geq 2$ if $d(u,v) = 1$ and $|f(u)-f(v)|\geq 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.
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)|\geq 2$ if $d(u,v) = 1$ and $|f(u)-f(v)|\geq 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.
참고문헌 (12)
- W. K. Hale, "Frequency assignment : Theory and applications", Proc. IEEE, 68, pp.1497~1514 (1980)
- J.R. Griggs, "Labelling graphs with a condition at distance 2", SIAM J. Discrete Math, 5, pp.586~595 (1992)
- G.J. Chang, "The L(2; 1)-labeling problem on graphs", SIAM J. Dis-crete Math, 9, pp.309~316 (1996)
- J.P. Georges, "Labeling trees with a condition at distance two", Discrete Math, 269, pp.127~148 (2003)
- W. F. Wang, "The L(2; 1)-labelling of trees", Discrete Appl. Math, 154, pp.598~603 (2007)
- R. K. Yeh, "A survey on labeling graphs with a condition at distance two", Discrete Math, 306, pp.1217~1231 (2006)
- T. Calamoneri, "The L(h; k)-labelling problem : an updated survey and annotated bibliography", Comput. J, 54, pp.1344~1371 (2011)
- D.A. Fotakis, "Radio-coloring in planar graphs : Complexity and approximations", Theo. Comput. Sci, 340, pp.514~538 (2005)
- D.A. Fotakis, "NP-Completeness Results and Ecient Approximations for Radiocoloring in Planar Graphs", Proceedings of the 25th International Symposium on Mathemati-cal Foundations of Computer Science, Lecture Notes of Computer Science, 1893, pp.363~372 (2000), Springer
- J. Griggs, "Minimum span channel assignments, Recent Advances in Radio Channel Assignments", Invited Minisymposium, Discrete Math (1998)
- Y.L. Lin, "Algorithms for square roots of graphs", SIAM J. Discrete Math, 8, pp.99~118 (1995)
- K.W. Lih, "Coloring the square of an outerplanar graph", Tai-wanese J. Math, 10(4), pp.1015~1023 (2006)