节点文献
距离限制下的点可区别全色数的一个上界
A Bound on Vertex Distinguishing Total Coloring of Graphs with Distance Constraint for Recurrent Event Data
【摘要】 图G的一个正常全染色被称作D(β)-点可区别全染色,如果G中距离不超过β的任意两点有不同的色集,其中,每个点的色集由该点和其邻边的颜色所组成.本文得到了图G的一个D(β)-点可区别全色数的新上界.
【Abstract】 A proper total coloring of the graph G is called D(β)-vertex distinguishing,if any two vertices whose distance is at mostβhave different color sets,where the color set of a vertex is the set which is composed of all colors of the vertex and the edges incident to it. In this paper,we obtain a new upper bound on D(β)-vertex distinguishing total coloring of a graph.
【关键词】 点可区别全染色;
D(β)-点可区别全染色;
Lovász局部引理;
【Key words】 vertex-distinguishing-total coloring; D(β)-vertex-distinguishing-total coloring; the Lovasz Local Lemma;
【Key words】 vertex-distinguishing-total coloring; D(β)-vertex-distinguishing-total coloring; the Lovasz Local Lemma;
【基金】 国家自然科学基金(10771091);甘肃省然科学基金(No1010RJZAO76);甘肃省“十一五”规划课题(2009)GXG144资助项目
- 【文献出处】 应用数学学报 ,Acta Mathematicae Applicatae Sinica , 编辑部邮箱 ,2011年03期
- 【分类号】O157.5
- 【被引频次】5
- 【下载频次】61