【摘要】 图G的一个L(1,1,1)-标号是从顶点集V(G)到非负整数集的一个映射f,使得当d(u,v)=1,2,3时,都有|f (u)-f(v)|≥1.不妨设0为最小标号,则称图G的所有L(1,1,1)-标号中的最大跨度f(v)的最小数为图G的L(1,1,1)-标号数.给出了竖梯的局部替换图的L(1,1,1)-标号数的确切值.更多还原

【Abstract】 An L(1,1,1)-labeling of a graph G is a mapping from the vertex set V(G) to the set of all nonnegative integers such that|f(u)-f(v)|≥1 if d(u,v)=1,2,3.Without loss of generality,let the minimum label be 0,then the L(1,1,1)-label number of a graph G is the minimum number of the max span f(v) under all the L(1,1,1)-labeling of G.The L(1,1,1)-labeling numbers of the local-replacements of the vertical ladders were given.更多还原