【摘要】 对给定的正整数d,图G的L(d,1)-标号是从V(G)到非负整数的函数,且满足:任意两个相邻顶点的标号差至少为d,而且距离为2的任两个顶点的标号至少为1.L(d,1)-标号的跨度是标号差的最大值.G的L(d,1)-标号数是G的所有L(d,1)-标号的最小跨度.本文完全给出了M bius梯子的L(d,1)-标号数.更多还原

【Abstract】 Given any positive integer d,a L(d,1)-labeling of a graph G is an assignment of nonnegative integers to V(G) such that the difference between labels of adjacent vertices is at least d,and the difference between labels of vertices that are distance two apart is at least 1.The span of the L(d,1)-labeling of a graph G is the difference between the maximum and minimum integers it uses.The λd-number of G is the minimum span over all L(d,1)-labelings of G.This paper investigates the λd-numbers of the Mbius ladders.更多还原