两类图的(d,1)-全标号  

The(d,1)-total labelling of two kinds of graphs

作　　者：陈东[1] 

机构地区：[1]浙江师范大学行知学院,浙江金华321004

出　　处：《浙江师范大学学报（自然科学版）》2008年第3期283-287,共5页Journal of Zhejiang Normal University:Natural Sciences

摘　　要：图G的一个k-(d,1)-全标号是一个映射f:V(G)∪E(G)→{0,1,…,k},使得任意2个相邻的点和相邻的边有不同值,且任一对相关联的点和边的值差的绝对值至少为d.G的(d,1)-全标号数λdT(G)定义为G有一个k-(d,1)-全标号的最小的k值.得到了扇图与轮图的(d,1)-全标号数.The （ d, 1 ） -total labelling number λ^Td（G） of a graph G is the width of the smallest range of integers that suffices to label the vertices and edges of G such that no two adjacent vertices or two adjacent edges have the same labels and the difference between the labels of a vertex and its incident edges is at least d. The （ d, 1 ） -total labelling numbers of the fan and wheel graphs were presented.

关 键 词：(D 1)-全标号 距离2标号 扇图 轮图 

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