Hits :

First Author : Wang, Wei-Fan

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

Date of Publication : 2006-01-01

Document Type : 期刊

Journal : Discrete Applied Mathematics

Volume: Vol.154

Issue : NO.3

Page Number : 598-603

ISSN : 0166-218X

Translation or Not : no

Abstract : An -labelling of a graph G is an assignment of nonnegative integers to the vertices of G such that adjacent vertices have numbers at least 2 apart, and vertices at distance 2 have distinct numbers. The -labelling number of G is the minimum range of labels