Abstract
A (p,q)-total labeling of a graph G is an assignment f from the vertex set V(G) and the edge set E(G) to the set of nonnegative integers such that |f(x) − f(y)| ≥ p if x is a vertex and y is an edge incident to x, and |f(x) − f(y)| ≥ q if x and y are a pair of adjacent vertices or a pair of adjacent edges, for all x and y in V(G) ∪ E(G). A k-(p,q)-total labeling is a (p,q)-total labeling f:V(G) ∪ E(G)→{0,...,k}, and the (p,q)-total labeling problem asks the minimum k, which we denote by \(\lambda^T_{p,q}(G)\), among all possible assignments. In this paper, we first give new upper and lower bounds on \(\lambda^T_{p,q}(G)\) for some classes of graphs G, in particular, tight bounds on \(\lambda^T_{p,q}(T)\) for trees T. We then show that if p ≤ 3q/2, the problem for trees T is linearly solvable, and give a complete characterization of trees achieving \(\lambda^T_{p,q}(T)\) if in addition Δ ≥ 4 holds, where Δ is the maximum degree of T. It is contrasting to the fact that the L(p,q)-labeling problem, which is a generalization of the (p,q)-total labeling problem, is NP-hard for any two positive integers p and q such that q is not a divisor of p.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These 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.
References
Bazzaro, F., Montassier, M., Raspaud, A.: (d,1)-total labelling of planar graphs with large girth and high maximum degree. Discr. Math. 307, 2141–2151 (2007)
Behzad, M.: Graphs and their chromatic numbers. Ph.D. Thesis, Michigan State University (1965)
Calamoneri, T.: The L(h,k)-labelling problem: A survey and annotated bibliography. The Computer Journal 49, 585–608 (2006) (The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography, http://www.dsi.uniroma1.it/~calamo/PDF-FILES/survey.pdf , ver. October 19, 2009)
Chang, G.J., Ke, W.-T., Kuo, D., Liu, D.D.-F., Yeh, R.K.: On L(d,1)-labeling of graphs. Discr. Math. 220, 57–66 (2000)
Chang, G.J., Kuo, D.: The L(2,1)-labeling problem on graphs. SIAM J. Discr. Math. 9, 309–316 (1996)
Chen, D., Wang, W.: (2,1)-Total labelling of outerplanar graphs. Discr. Appl. Math. 155, 2585–2593 (2007)
Dekar, L., Effantin, B., Kheddouci, H.: [r,s,t]-coloring of trees and bipartite graphs. Discr. Math. 310, 260–269 (2010)
Fiala, J., Golovach, P.A., Kratochvíl, J.: Computational Complexity of the Distance Constrained Labeling Problem for Trees. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 294–305. Springer, Heidelberg (2008)
Fiorini, S.: On the chromatic index of outerplanar graphs. J. Combin. Theory Ser. B 18, 35–38 (1975)
Georges, J.P., Mauro, D.W.: Generalized vertex labeling with a condition at distance two. Congr. Numer. 109, 141–159 (1995)
Georges, J.P., Mauro, D.W.: Labeling trees with a condition at distance two. Discr. Math. 269, 127–148 (2003)
Griggs, J.R., Yeh, R.K.: Labelling graphs with a condition at distance 2. SIAM J. Discr. Math. 5, 586–595 (1992)
Hasunuma, T., Ishii, T., Ono, H., Uno, Y.: A linear time algorithm for L(2,1)-labeling of trees. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 35–46. Springer, Heidelberg (2009)
Hasunuma, T., Ishii, T., Ono, H., Uno, Y.: A tight upper bound on the (2,1)-total labeling number of outerplanar graphs. In: CoRR abs/0911.4590 (2009)
Havet, F., Yu, M.-L.: (d,1)-Total labelling of graphs. Technical Report 4650, INRIA (2002)
Havet, F., Yu, M.-L.: (p,1)-Total labelling of graphs. Discr. Math. 308, 496–513 (2008)
Havet, F., Thomassé, S.: Complexity of (p,1)-total labelling. Discr. Appl. Math. 157, 2859–2870 (2009)
Kemnitz, A., Marangio, M.: [r,s,t]-Colorings of graphs. Discr. Math. 307, 199–207 (2007)
Lih, K.-W., Liu, D.D.-F., Wang, W.: On (d,1)-total numbers of graphs. Discr. Math. 309, 3767–3773 (2009)
Montassier, M., Raspaud, A.: (d,1)-total labeling of graphs with a given maximum average degree. J. Graph Theory 51, 93–109 (2006)
Villà, M.S.: [r,s,t]-colourings of paths, cycles and stars. Doctoral Thesis, TU Bergakademie, Freiberg (2005)
Vizing, V.G.: Some unsolved problems in graph theory. Russian Mathematical Surveys 23, 125–141 (1968)
Wang, W., Chen, D.: (2,1)-Total number of trees maximum degree three. Inf. Process. Lett. 109, 805–810 (2009)
Whittlesey, M.A., Georges, J.P., Mauro, D.W.: On the λ-number of Qn and related graphs. SIAM J. Discr. Math. 8, 499–506 (1995)
Yeh, R.K.: A survey on labeling graphs with a condition at distance two. Discr. Math. 306, 1217–1231 (2006)
Zhou, X., Matsuo, Y., Nishizeki, T.: List total colorings of series-parallel graphs. J. Discr. Algorithms 3, 47–60 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hasunuma, T., Ishii, T., Ono, H., Uno, Y. (2010). The (p,q)-total Labeling Problem for Trees. In: Cheong, O., Chwa, KY., Park, K. (eds) Algorithms and Computation. ISAAC 2010. Lecture Notes in Computer Science, vol 6507. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17514-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-17514-5_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17513-8
Online ISBN: 978-3-642-17514-5
eBook Packages: Computer ScienceComputer Science (R0)