关于P_m∨S_n的邻点可区别全染色  

On Adjacent Vertex Distinguishing Total Coloring of P_m∨S_n

作　　者：唐国梅[1] 马刚[1] 马少仙[1] 

机构地区：[1]西北民族大学计算机科学与信息工程学院,甘肃兰州730030

出　　处：《华东交通大学学报》2006年第5期133-135,共3页Journal of East China Jiaotong University

基　　金：国家民委科研项目(No.05XB07)

摘　　要：对一个正常的全染色满足相邻点的点及其关联边染色的色集不同时,称为邻点可区别全染色,其所用最少染色数称为邻点可区别全色数.本文得到了路Pm与星Sn的联图Pm∨Sn的邻点可区别全色数.A total-coloring is called adjacent vertex-distinguishing if every two adjacent vertices are incident to different sets of colored vertex and incident edge with vertex.The minimum number of colors required for an adjacent vertex-distinguishing proper total-coloring,a simple graph G is denoted by χ_(at)(G).In this paper,we obtain the adjacent vertex distinguishing total chromatic number of P_m∨S_n.

关 键 词：路 星 联图 邻点可区别全色数 

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