The $(2,1)$-total number $\lambda_2^t(G)$ of a graph $G$ is the width of the smallest range of integers that suffices to label the vertices and edges of $G$ such that no two adjacent vertices or two adjacent edges have the same label and the difference between the label of a vertex and its incident edges is at least $2$. In this paper, we characterize completely the $(2,1)$-total number of the join of two paths and the join of two cycles.
References
F. Bazzaro, M. Montassier and A. Raspaud, $(d,1)$-Total labelling of planar graphs with large girth and high maximum degree, Discrete Math., 307 (2007), 2141-2151. MR2326175 1120.05076 10.1016/j.disc.2005.12.059 F. Bazzaro, M. Montassier and A. Raspaud, $(d,1)$-Total labelling of planar graphs with large girth and high maximum degree, Discrete Math., 307 (2007), 2141-2151. MR2326175 1120.05076 10.1016/j.disc.2005.12.059
O. V. Borodin, A. V. Kostochka and D. R. Woodall, List edge and list total coloring of multigraphs, J. Combin. Theory Ser. B, 71 (1997), 184-204. MR1483474 0876.05032 10.1006/jctb.1997.1780 O. V. Borodin, A. V. Kostochka and D. R. Woodall, List edge and list total coloring of multigraphs, J. Combin. Theory Ser. B, 71 (1997), 184-204. MR1483474 0876.05032 10.1006/jctb.1997.1780
G. J. Chang and D. Kuo, The $L(2,1)$-labelling problem on graphs, SIAM J. Discrete Math., 9 (1996), 309-316. 0860.05064 10.1137/S0895480193245339 G. J. Chang and D. Kuo, The $L(2,1)$-labelling problem on graphs, SIAM J. Discrete Math., 9 (1996), 309-316. 0860.05064 10.1137/S0895480193245339
D. Chen and W. Wang, $(2,1)$-Total labelling of outerplanar graphs, Discrete Appl. Math., 155 (2007), 2585-2593. MR2365068 1129.05041 10.1016/j.dam.2007.07.016 D. Chen and W. Wang, $(2,1)$-Total labelling of outerplanar graphs, Discrete Appl. Math., 155 (2007), 2585-2593. MR2365068 1129.05041 10.1016/j.dam.2007.07.016
J. R. Griggs and R. K. Yeh, Labelling graphs with a condition at distance 2, SIAM J. Discrete Math., 5 (1992), 586-595. 0767.05080 10.1137/0405048 J. R. Griggs and R. K. Yeh, Labelling graphs with a condition at distance 2, SIAM J. Discrete Math., 5 (1992), 586-595. 0767.05080 10.1137/0405048
F. Havet and M.-L. Yu, $(p,1)$-Total labelling of graphs, Discrete Math., 308 (2008), 496-513. 1137.05062 10.1016/j.disc.2007.03.034 F. Havet and M.-L. Yu, $(p,1)$-Total labelling of graphs, Discrete Math., 308 (2008), 496-513. 1137.05062 10.1016/j.disc.2007.03.034
J. Huang, H. Sun, W. Wang and D. Chen, $(2,1)$-Total labelling of trees with sparse vertices of maximum degree, Inform. Process. Lett., 109 (2009), 199-203. 1189.05153 10.1016/j.ipl.2008.10.001 J. Huang, H. Sun, W. Wang and D. Chen, $(2,1)$-Total labelling of trees with sparse vertices of maximum degree, Inform. Process. Lett., 109 (2009), 199-203. 1189.05153 10.1016/j.ipl.2008.10.001
A. V. Kostochka, The total chromatic number of any multigraph with maximum degree five is at most seven, Discrete Math., 162 (1996), 199-214. MR1425788 0871.05023 10.1016/0012-365X(95)00286-6 A. V. Kostochka, The total chromatic number of any multigraph with maximum degree five is at most seven, Discrete Math., 162 (1996), 199-214. MR1425788 0871.05023 10.1016/0012-365X(95)00286-6
K.-W. Lih, Daphne D.-F. Liu and W. Wang, On $(d,1)$-total numbers of graphs, Discrete Math., 309 (2009), 3767-3773. 1208.05130 10.1016/j.disc.2008.10.008 K.-W. Lih, Daphne D.-F. Liu and W. Wang, On $(d,1)$-total numbers of graphs, Discrete Math., 309 (2009), 3767-3773. 1208.05130 10.1016/j.disc.2008.10.008
M. Molloy and B. Reed, A bound on the total chromatic number, Combinatorica, 18 (1998), 241-280. 0921.05033 10.1007/PL00009820 M. Molloy and B. Reed, A bound on the total chromatic number, Combinatorica, 18 (1998), 241-280. 0921.05033 10.1007/PL00009820
M. Molloy and M. R. Salavatipour, A bound on the chromatic number of the square of a planar graph, J. Combin. Theory Ser. B, 94 (2005), 189-213. 1071.05036 10.1016/j.jctb.2004.12.005 M. Molloy and M. R. Salavatipour, A bound on the chromatic number of the square of a planar graph, J. Combin. Theory Ser. B, 94 (2005), 189-213. 1071.05036 10.1016/j.jctb.2004.12.005
M. Montassier and A. Raspaud, $(d,1)$-Total labelling of graphs with a given maximum average degree, J. Graph Theory, 51 (2006), 93-109. 1084.05061 10.1002/jgt.20124 M. Montassier and A. Raspaud, $(d,1)$-Total labelling of graphs with a given maximum average degree, J. Graph Theory, 51 (2006), 93-109. 1084.05061 10.1002/jgt.20124
D. Sakai, Labelling chordal graphs: distance two condition, SIAM J. Discrete Math., 7 (1994), 133-140. 0794.05118 10.1137/S0895480191223178 D. Sakai, Labelling chordal graphs: distance two condition, SIAM J. Discrete Math., 7 (1994), 133-140. 0794.05118 10.1137/S0895480191223178
W. Wang and K.-W. Lih, Labelling planar graphs with conditions on girth and distance two, SIAM J. Discrete Math., 17 (2004), 264-275. MR2032294 1041.05068 10.1137/S0895480101390448 W. Wang and K.-W. Lih, Labelling planar graphs with conditions on girth and distance two, SIAM J. Discrete Math., 17 (2004), 264-275. MR2032294 1041.05068 10.1137/S0895480101390448
W. Wang, The $L(2,1)$-labelling of trees, Discrete Appl. Math., 154 (2006), 598-603. 1088.05066 10.1016/j.dam.2005.09.007 W. Wang, The $L(2,1)$-labelling of trees, Discrete Appl. Math., 154 (2006), 598-603. 1088.05066 10.1016/j.dam.2005.09.007
W. Wang, Total chromatic number of planar graphs with maximum degree ten, J. Graph Theory, 54 (2007), 91-102. 1110.05037 10.1002/jgt.20195 W. Wang, Total chromatic number of planar graphs with maximum degree ten, J. Graph Theory, 54 (2007), 91-102. 1110.05037 10.1002/jgt.20195
W. Wang and D. Chen, $(2,1)$-Total number of trees with maximum degree three, Inform. Process. Lett., 109 (2009), 805-810 MR2530634 1209.68386 10.1016/j.ipl.2009.03.027 W. Wang and D. Chen, $(2,1)$-Total number of trees with maximum degree three, Inform. Process. Lett., 109 (2009), 805-810 MR2530634 1209.68386 10.1016/j.ipl.2009.03.027
M. A. Whittlesey, J. P. Georges and D. W. Mauro, On the $\lambda$-number of $Q_n$ and related graphs, SIAM J. Discrete Math., 8 (1995), 499-506. 0844.05084 10.1137/S0895480192242821 M. A. Whittlesey, J. P. Georges and D. W. Mauro, On the $\lambda$-number of $Q_n$ and related graphs, SIAM J. Discrete Math., 8 (1995), 499-506. 0844.05084 10.1137/S0895480192242821
