几类分裂图的(2,1)-全标号  

(2,1)-Total Labelling of Some Splited Graphs

作　　者：刘秀丽[1] 

机构地区：[1]菏泽学院数学系,山东菏泽274015

出　　处：《江南大学学报（自然科学版）》2012年第5期627-630,共4页Joural of Jiangnan University (Natural Science Edition)　

摘　　要：对与频道分配有关的一种染色问题——(p,1)-全标号进行研究,结果表明,图G的(p,1)-全标号是一个映射f:V(G)∪E(G)→{0,1,…,k},使得:G的任两个相邻的顶点得到不同的整数;G的任两个相邻的边得到不同的整数;任一个点和与它相关联的边得到的整数至少相差p.(p,1)-全标号的跨度是指两个标号差的最大值。图G的(p,1)-全标号的最小跨度叫(p,1)-全标号数,记作λTp(G)。根据分裂图的特征,利用穷染法,得到了几类分裂图的(2,1)-全标号数。We studied （p, 1 ）-total labelling of graphs G, which related to frequency assignment problem of coloring prob- lem. （p, 1 ）-Total labelling of is an assignment f from the set V（G） U E（G） to the integer {0,1,2,...,k} , such that： any two adjacent vertices of G receive distinct integers; any two adjacent edges of G receive distinct integers; and a vertex and its incident edge receive integers that differ by at least p in absolute value. The span of a （p, 1 ）-total labelling is the maxi- mum difference between two labels. The minimum of span of a （p, 1 ）-total labelling of G is called the （p, 1 ）-total number and denoted by AT （G）. In this paper, the （2, I ）-total numbers of some splited graphs were given by the eternal coloring according to their feature.

关 键 词：染色 (P 1)-全标号 (P 1)-全标号数 分裂图 

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