东南大学学报（英文版）2005，Vol.21Issue(2)：244-248,5.
关于距离图的L(2,1)-标号着色
On L(2,1)-labellings of distance graphs
摘要
Abstract
The L(2,1)-labelling number of distance graphs G(D),denoted by λ(D),is studied.It is shown that distance graphs satisfy λ(G)≤Δ2.Moreover,we prove λ({1,2,...,k})＝2k+2 and λ({1,3,...,2k-1})＝2k+2 for any fixed positive integer k.Suppose k,a∈N and k,a≥2.If k≥a,then λ({a,a+1,...,a+k-1})＝2(a+k-1).Otherwise,λ({a,a+1,...,a+k-1})≤min{2(a+k-1),6k-2}.When D consists of two positive integers,6≤λ(D)≤8.For the special distance sets D＝{k,k+1}( k∈N),the upper bound of λ(D) is improved to 7.关键词
频道分配问题/L(2,1)-标号着色/距离图Key words
channel assignment problem/L(2,1)-labelling/distance graphs分类
数理科学引用本文复制引用
陶昉昀,顾国华,许克祥..关于距离图的L(2,1)-标号着色[J].东南大学学报（英文版）,2005,21(2):244-248,5.基金项目
The National Natural Science Foundation of China (No.10171013). （No.10171013）
