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

The(2,1)-total Labeling of Two Special Graphs

研究了与频道分配有关的一种染色问题——(p,1)-全标号.(p,1)-全标号是从V(G)∪E(G)到集合{0,1,…,k}的1个映射,满足:①G的任2个相邻的顶点得到不同的整数;②G的任2个相邻的边得到不同的整数;③任1个点和与它相关联的边得到的整数至少相差p.称最小的数k为图G的(p,1)-全标号数.根据所构造图的特征,利用穷染法得到了这些图的(2,1)-全标号数.

We studied（p,1）-totallabeling of a graphs G,which related to frequency assignment problem of coloring problem.（p,1）-total labeling is an assignment from the set V（G）∪E（G） to the integer0,1,…,k,such that： ① any two adjacent vertices of G receive distinct integers;② any two adjacent edges of G receive distinctintegers;③ a vertex and its incident edge receive integers that differ by at least p in absolutevalue.The minimal number of k is called the（p,1）-total number of G.The（2,1）-total numbers of these graphs were given by the eternal coloring according to their feature.