Irregularity strength of trees

被引:79
作者
Amar, D [1 ]
Togni, O [1 ]
机构
[1] LABRI, UMR 5800, F-33405 Talence, France
关键词
irregularity strength; irregular degree; edge labelling;
D O I
10.1016/S0012-365X(98)00112-5
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The main result of this paper establishes that the irregularity strength of any tree with no vertices of degree two is its number of pendant vertices. (C) 1998 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:15 / 38
页数:24
相关论文
共 5 条
[1]  
Brouwer A. E., 1976, P C CNRS PROBLEMES C, P35
[2]  
CAMMACK LA, 1991, IRREGULARITY STRENGT, V81, P113
[3]  
Chartrand G., 1988, C NUMER, V64, P197
[4]  
Lehel J., 1991, GRAPH THEORY COMBINA, V2, P765
[5]  
Skolem T., 1957, Mathematica Scandinavica, V5, P57