Hits :

First Author : Wang,Weifan

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

Date of Publication : 2008-01-01

Document Type : 期刊

Journal : Discrete Applied Mathematics

Volume: Vol.156

Issue : No.12

Page Number : 2241-2249

ISSN : 0166-218X

Translation or Not : no

Key Words : RINGS;of;integers;LABELS;GRAPHIC;methods;NUMERALS

Abstract : Let and be positive integers. An -labelling of a graph is a function such that if and are adjacent and if and are of distance two apart. The -labelling number of is the least for which has an -labelling . In this paper we prove that for every planar graph