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

Some new results on the (2,1)-total labelling of graphs

作　　者：刘秀丽[1] 

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

出　　处：《延边大学学报（自然科学版）》2013年第2期85-87,共3页Journal of Yanbian University（Natural Science Edition）

基　　金：山东省自然科学基金资助项目(ZR2011AQ008)

摘　　要：研究了与频道分配有关的一种(p,1)-全标号染色问题.首先通过在一个顶点粘结不同的简单图构造了几类有趣图,然后根据所构造图的特征,利用穷染法给出了一种新的标号方法,得到了这些图的(2,1)-全标号数.(p,1)-全标号是对图的全染色的一种推广.We studied a coloring problem of（p,1）-total labelling,which is related to frequency assignment.Some special graphs were constructed by bonding different simple graphs in one vertex.By using the eternal coloring method,a new labelling method according to the feature of these graphs was given and the（2,1）-total numbers of these graphs was obstained.The（p,1）-total labelling of graphs extends the total coloring of graphs.

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

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