Hits :

First Author : Shu, Qiaojun

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2017-01-01

Document Type : 期刊

Journal : Journal of Combinatorial Optimization

Volume: Vol.33

Issue : No.3

Page Number : 1011-1020

ISSN : 1382-6905

Translation or Not : no

Key Words : (2,1)-total labelling;(2,1)-total number;Tree;Maximum degree

Abstract : A k-(2, 1)-total labelling of a graph G is a mapping such that adjacent vertices or adjacent edges receive distinct labels, and a vertex and its incident edges receive labels that differ in absolute value by at least 2. The (2, 1)-total number, denoted ,