Hits :

First Author : Huang,Jing

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

Date of Publication : 2009-01-01

Document Type : 期刊

Journal : Information Processing Letters

Volume: Vol.109

Issue : No.3

Page Number : 199-203

ISSN : 0020-0190

Translation or Not : no

Key Words : MATHEMATICAL;analysis;PROGRAMMING;(Mathematics)TREES;(Graph;theory)GRAPH;theoryCOMBINATORIAL;analysisNUMERICAL;analysis

Abstract : The -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, or two adjacent edges, have the same label and the difference between the la