Hits :

First Author : Weifan Wang

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

Date of Publication : 2009-01-01

Document Type : 期刊

Journal : Information Processing Letters

Volume: Vol.109

Issue : No.14

Page Number : 805-810

ISSN : 0020-0190

Translation or Not : no

Key Words : Combinatorial;problems;Maximum;degree;(2,1)-Total;labelling;Tree

Abstract : The (2,1)-total labelling number   of a graph G is the width of the smallest range of integers that suffices to label the vertices and the edges of G such that no two adjacent vertices have the same label, no two adjacent edges have the same label and the