摘要
研究了与频道分配有关的一种染色问题——(p,1)-全标号。(p,1)-全标号是从V(G)∪E(G)到集合{0,1,…,k}的一个映射,满足:G的任两个相邻的顶点得到不同的整数;G的任两个相邻的边得到不同的整数;任一个点和与它相关联的边得到的整数至少相差p。称最小的数k为图G的(p,1)-全标号数。根据所构造图的特征,利用穷染法,得到了这些图的(2,1)-全标号数。
The main purpose of this paper is to study （p, 1）-total labeling of a graphs G, which was to be related to frequency assignment problem of coloring problem. （p, 1 ） -total labeling was an assignment from the set V（G） 1.3 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. The minimal number of k is called the （p, 1 ） -total number of G. In this paper, the （2,1） -total numbers of some graphs were given by the eternal coloring according to their feature.
出处
《江南大学学报（自然科学版）》
CAS
2011年第6期749-752,共4页
Joural of Jiangnan University (Natural Science Edition)
