距离限制下的点可区别全色数的一个上界

A Bound on Vertex Distinguishing Total Coloring of Graphs with Distance Constraint for Recurrent Event Data

图G的一个正常全染色被称作D(β)-点可区别全染色,如果G中距离不超过β的任意两点有不同的色集,其中,每个点的色集由该点和其邻边的颜色所组成.本文得到了图G的一个D(β)-点可区别全色数的新上界.

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.