Mbius梯的(d,1)-全标号(英文)  

(d,1)-total labelings of the Mbius Ladders

作　　者：吕大梅[1] 李海萍[2] 裔丹[1] 张科[1] 石渡[1] 

机构地区：[1]南通大学数学系,江苏南通226007 [2]河北科技大学理学院,河北石家庄060018

出　　处：《浙江大学学报（理学版）》2013年第4期382-386,共5页Journal of Zhejiang University（Science Edition）

基　　金：Supported by NSFC(10671033);The Natural Science Foundation of Nantong University(11Z055,11Z056,11Z059);JSSPITP(2012JSSPITP1555)

摘　　要：图G的(d,1)-全标号是从V(G)∪E(G)到非负整数的函数,且满足:(i)G中任意2个相邻顶点的标号不同;(ii)G中任意2个相邻边的标号不同;(iii)顶点与其关联边的标号差至少为d.(d,1)-全标号的跨度是标号差的最大值.G的(d,1)-全标号数是G的所有(d,1)-全标号的最小跨度,记为λTd(G).本文完全给出了Mbius梯的(d,1)-全标号数.A （d,1）-total labeling of a graph G is an assignment of nonnegative integers to V（G） U E（G） such that： （i） any two adjacent vertices of G receive different integers; （ii） any two adjacent edges of G receive different inte- gers; and （iii） a vertex and its incident edge receive integers that differ at least d in absolute value. The span of a （d, 1）-total labeling is the maximum difference between two labels. The （d, 1）-total labeling number of G, denoted by AT （G）, is the minimum span over all （d, 1）-total labelings of G. In this paper, the （d, 1）-total labeling numbers of the Mobius Ladders are given completely for any nonnegative integer d.

关 键 词：(d 1)-全标号数 Cartesian积 Mobius梯子 

分 类 号：O157.5[理学—数学]