摘要
对一个正常的全染色满足不同点的点及其关联边染色的色集不同时,称为点可区别全染色,其所用最少染色数称为点可区别全色数.本文得到了路Pm与星Sn的联图Pm∨Sn的点可区别全色数.
A total coloring is called vertex distinguishing if every two vertices are incident to different sets of colored vertex and incident edge with vertex. The minimum number of colors required for a vertex-distin-guishing total coloring,a simple graph G is denoted by Xvt, （G）. In this paper, we obtain the vertex-distin- guishing total chromatic number of Pm∨ Sn.
出处
《兰州交通大学学报》
CAS
2007年第4期136-138,共3页
Journal of Lanzhou Jiaotong University
基金
国家自然科学基金资助项目(40301037)
国家民委科研项目(05XB07)
关键词
路
星
联图
点可区别全色数
path
star
joingraph
vertex-distinguishing total chromatic number
