关于图的(2,1)-全标号的几个结果  

Some New Results on the (2,1)-Total Labeling of Graphs

作　　者：刘秀丽[1] 

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

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

摘　　要：图G的(p,1)-全标号是与频道分配有关的一种染色问题,是从V(G)∪E(G)到集合{0,1,…,k}的一个映射,使得:G的任两个相邻的顶点得到不同的整数;G的任两个相邻的边得到不同的整数;任一个点和与它相关联的边得到的整数至少相差p。(p,1)-全标号的跨度是指两个标号差的最大值。图G的(p,1)-全标号的最小跨度叫(p,1)-全标号数,记作λpT(G)。得到了几类有趣图的(2,1)-全标号数。The（p,1）-total labeling of graphs G,to be related to frequency assignment problem of coloring problem,was an assignment f from the set V（G）∪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 labeling is the maximum difference between two labels.The minimum of span of a（p,1）-total labeling of G is called the（p,1）-total number and denoted by λTp（G）.The（2,1）-total numbers of some special graphs were given.

关 键 词：全染色 (P 1)-全标号 (p 1)-全标号数 

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