Total Labelling of the Tree
The (2,1 )-total labelling of the tree has been widely studied. In this paper we study the (3,l)total labelling number of the tree. The (3,l)-total labelling number of the tree is the width of the smallest range of integers to label the vertices and the edges such that no two adjacent vertices or two adjacent edges have the same labels and the difference between the labels of a vertex and its incident edges is at least 3. We prove that if the distance of the maximum degree in the tree is not 2, then the (3,l)-total labelling number is the maximum degree plus 3.
Tree Degree Handle
Haina Sun
Ningbo Institute of Technology, Zhejiang University, Ningbc Zhejiang Province 315100, P.R. China
国际会议
上海
英文
2275-2278
2011-10-21（万方平台首次上网日期，不代表论文的发表时间）