摘要
研究了与频道分配有关的一种染色-(p,1)-全标号.通过在一个顶点粘结不同的简单图构造了几类有趣图,根据所构造图的特征,利用穷染法,给出了一种标号方法,得到了平凡和非平凡叶子图Gm,4、风车图K3t和图Dm,n的(2,1)-全标号数.(p,1)-全标号是对图的全染色的一种推广.
In this paper, we studied a coloring problem-（p, 1）-total labelling of some graphs, which is related to frequency assignment. Some special graphs were constructed by bonding different simple graphs in one vertex in this paper. By using the eternal coloring method, we gave a new labelling method according to the feature of these graphs and obtained the （2,1）-total numbers of Gin,4 graph, K3^t graph and Dm,n graph. And the （p, 1）-total labelling of graphs extends the total coloring of graphs.
出处
《数学的实践与认识》
CSCD
北大核心
2013年第18期141-145,共5页
Mathematics in Practice and Theory
