Abstract
A λ-labeling of a graph G is an assignment of labels from the set {0,...,λ} to the vertices of a graph G such that vertices at distance at most two get different labels and adjacent vertices get labels which are at least two apart. We study the minimum value λ = λ (G) such that G admits a λ-labeling. We show that for every fixed value k ≥ 4 it is NP-complete to determine whether λ(G) ≤ k. We further investigate this problem for sparse graphs (k-almost trees), extending the already known result for ordinary trees.
In a generalization of this problem we wish to find a labeling such that vertices at distance two are assigned labels that differ by at least q and the labels of adjacent vertices differ by at least p (where p and q are given positive integers). We denote the minimum number of labels by L(G;p,q) (hence λ(G) = L(G;2, 1)). We show several hardness results for L(G; p, q) including that for any p < q ≥ 1 there is a λ = λ(p,q) such that deciding if L(G;p,q) ≤ λ(p,q) is NP-complete.
Research supported in part by the Czech Research Grants GAUK 158/99 and GAČR 201/1996/0194.
Supported by DIMATIA and GAČR 201/99/0242
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abello J., M.R. Fellows and J.C. Stillwell, On the complexity and combinatorics of covering finite complexes, Australasian Journal of Combinatorics 4 (1991), 103–112 351
Brandstädt, Andreas, Special graph classes-A survey, Schriftenreihe des Fachsbereichs Mathematik, SM-DU-199 (1991), Universität Duisburg Gesamthochschule. 352
Chang, G. J. and D. Kuo, The L(2, 1)-labeling problem on graphs, SIAM J. Disc. Math. 9, (1996), pp. 309–316. 352, 353
Griggs, J. R. and R. K. Yeh, Labelling graphs with a condition at distance 2, SIAM J. Disc. Math. 5, (1992), pp. 586–595. 350, 353, 356
Kratochvíl, Jan, Regular codes in regular graphs are difficult, Discrete Math. 133 (1994), 191–205 351
Kratochvíl, Jan, Andrzej Proskurowski, and Jan Arne Telle, Covering regular graphs Journal of Combin. Theory Ser. B 71 (1997), 1–16 351
Kratochvíl, Jan, Andrzej Proskurowski, and Jan Arne Telle, Covering directed multigraphs I. Colored directed multigraphs, In: Graph-Theoretical Concepts in Computer Science, Proceedings 23rd WG’ 97, Berlin, Lecture Notes in Computer Science 1335, Springer Verlag, (1997), pp. 242–257. 351, 352
Kratochvíl, Jan, Andrzej Proskurowski, and Jan Arne Telle, Complexity of graph covering problems Nordic Journal of Computing 5 (1998), 173–195 351
Liu, D. D.-F. and R. K. Yeh, On distance two labellings of graphs, ARS Combinatorica 47, (1997), pp. 13–22. 351
Yeh, Kwan-Ching, Labeling graphs with a condition at distance two, Ph.D. Thesis, University of South Carolina, 1990. 350, 351
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fiala, J., Kloks, T., Kratochvíl, J. (1999). Fixed-Parameter Complexity of λ-Labelings. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds) Graph-Theoretic Concepts in Computer Science. WG 1999. Lecture Notes in Computer Science, vol 1665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46784-X_33
Download citation
DOI: https://doi.org/10.1007/3-540-46784-X_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66731-5
Online ISBN: 978-3-540-46784-7
eBook Packages: Springer Book Archive