几类特殊图的(2,1)-全标号

The(2,1)-total labelling of some special graphs

研究了与频道分配有关的1种(p,1)-全标号染色问题.(p,1)-全标号是从V(G)∪E(G)到集合{0,1,…,k}的1个映射,满足:①G的任2个相邻的顶点得到不同的整数;②G的任2个相邻的边得到不同的整数;③任1个点和与它相关联的边得到的整数至少相差p.通过在2个简单图之间叠加一系列匹配构造了几类有趣图,并根据所构造图的特征,利用穷染法得到了这些图的(2,1)-全标号数.

We study（p,1）-total labelling of a graph G,which related to frequency assignment problem of coloring problem.（p,1）-total labelling is an assignment from the set V（G）∪E（G） to the integer {0,1,…,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.Some special graphs are constructed by superimposing matchs between two simple graphs,and the（2,1）-total numbers of these graphs are given by the eternal coloring according to their feature.