浙江大学学报（理学版）
浙江大學學報（理學版）
절강대학학보（이학판）
JOURNAL OF ZHEJIANG UNIVERSITY
2011年
3期
256-261
,共6页
L(d,1)-标号%Cartesian积%M(o)bius梯子
L(d,1)-標號%Cartesian積%M(o)bius梯子
L(d,1)-표호%Cartesian적%M(o)bius제자
L(d,1)-labeling%Cartesian product%M(o)bius ladders
对给定的正整数d,图G的L(d,1)-标号是从V(G)到非负整数的函数,且满足:任意两个相邻顶点的标号差至少为d,而且距离为2的任两个顶点的标号至少为1.L(d,1)-标号的跨度是标号差的最大值.G的L(d,1)-标号数是G的所有L(d,1)-标号的最小跨度.本文完全给出了M(o)bius梯子的L(d,1)-标号数.
對給定的正整數d,圖G的L(d,1)-標號是從V(G)到非負整數的函數,且滿足:任意兩箇相鄰頂點的標號差至少為d,而且距離為2的任兩箇頂點的標號至少為1.L(d,1)-標號的跨度是標號差的最大值.G的L(d,1)-標號數是G的所有L(d,1)-標號的最小跨度.本文完全給齣瞭M(o)bius梯子的L(d,1)-標號數.
대급정적정정수d,도G적L(d,1)-표호시종V(G)도비부정수적함수,차만족:임의량개상린정점적표호차지소위d,이차거리위2적임량개정점적표호지소위1.L(d,1)-표호적과도시표호차적최대치.G적L(d,1)-표호수시G적소유L(d,1)-표호적최소과도.본문완전급출료M(o)bius제자적L(d,1)-표호수.
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(o)bius ladders.
