Total Labelling of the Tree

Abstract:

Article Preview

. The (2,1)-total labelling of the tree has been widely studied. In this paper we study the (3,1)-total labelling number of the tree. The (3,1)-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,1)-total labelling number is the maximum degree plus 3.

Info:

Periodical:

Edited by:

Paul P. Lin and Chunliang Zhang

Pages:

2275-2278

DOI:

10.4028/www.scientific.net/AMM.105-107.2275

Citation:

H. N. Sun "Total Labelling of the Tree", Applied Mechanics and Materials, Vols. 105-107, pp. 2275-2278, 2012

Online since:

September 2011

Authors:

Keywords:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.