Abstract
An L(p,q)-labeling of a graph is a labeling of its vertices by nonnegative integers such that the labels of adjacent vertices differ by at least p and the labels of vertices at distance 2 differ by at least q. The span of such a labeling is the maximum label used. Distance constrained labelings are an important graph theoretical approach to the Frequency Assignment Problem applied in mobile and wireless networks.In this paper we show that determining the minimum span of an L(p,q)-labeling of a tree is NP-hard whenever q is not a divisor of p. This demonstrates significant difference in computational complexity of this problem for q = 1 and q > 1. In addition, we give a sufficient and necessary condition for the existence of an H(p,q)-labeling of a tree in the case when the metric on the label space is determined by a strongly vertex transitive graph H. This generalizes the problem of distance constrained labeling in cyclic metric, that was known to be solvable in polynomial time for trees.KeywordsPolynomial TimeCommon NeighborPartial TreeLabel ProblemTransitive GraphThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.