东南大学学报（英文版）2004，Vol.20Issue(1)：122-125,4.
距离图L(2,1)标号着色问题
L(2,1)-labeling problem on distance graphs
摘要
Abstract
L(2, 1)-labeling number,λ(G(Z, D)), of distance graph G(Z, D) is studied. For general finite distance set D, it is shown that 2|D|+2≤λ(G(Z, D))≤D|2|+3|D|. Furthermore,λ(G(Z, D))≤8 when D consists of two prime positive odd integers is proved. Finally, a new concept to study the upper bounds of λ(G) for some special D is introduced. For these sets, the upper bound is improved to 7.关键词
L(2,1)标号着色/距离图/频道分配问题Key words
L(2, 1)-labeling/distance graph/channel assignment problem分类
数理科学引用本文复制引用
陶昉昀,顾国华..距离图L(2,1)标号着色问题[J].东南大学学报（英文版）,2004,20(1):122-125,4.基金项目
The National Natural Science Foundation of China(No. 10171013). （No. 10171013）
