东南大学学报（英文版）2005，Vol.21Issue(1)：111-114,4.
图的L(d,1)-标号的边跨度
Edge span of L(d,1)-labeling on some graphs
摘要
Abstract
Given a graph G and a positive integer d,an L(d,1)-labeling of G is a function f that assigns to each vertex of G a non-negative integer such that f(u)-f(v)≥d if dG(u,v)＝1;f(u)-f(v)≥1 if dG(u,v)＝2.The L(d,1)-labeling number of G,λd(G) is the minimum range span of labels over all such labelings,which is motivated by the channel assignment problem.We consider the question of finding the minimum edge span βd(G) of this labeling.Several classes of graphs such as cycles,trees,complete k-partite graphs,chordal graphs including triangular lattice and square lattice which are important to a telecommunication problem are studied,and exact values are given.关键词
L(d,1)-标号/边跨度/正三角形网格/正四边形网格/弦图/r-路Key words
L(d,1)-labeling/edge span/triangular lattice/square lattice/choral graphs/r-path分类
数理科学引用本文复制引用
冯桂珍,宋增民..图的L(d,1)-标号的边跨度[J].东南大学学报（英文版）,2005,21(1):111-114,4.基金项目
The National Natural Science Foundation of China (No.10171013). （No.10171013）
