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

ON THE TOTAL COLORING AND ADJACENT VERTEX-DISTINGUISHING TOTAL COLORING OF P_m∨S_m

作　　者：晁福刚[1] 强会英[1] 闫丽宏[1] 王文杰[1] 王治文[1] 张忠铺[1] 

机构地区：[1]兰州交通大学应用数学研究所,甘肃兰州730070

出　　处：《经济数学》2005年第3期327-330,共4页Journal of Quantitative Economics

基　　金：国家自然科学资助项目(No.19871036)

摘　　要：把星{u0,u1,u2…,un}中的每一个点与路{v1,v2,v3,…,vm}中的每一个点相连,得到路和星的联图,记为Pm∨Sn.本文给出了PmVSn的邻点可区别全色数.A simple graph in which every vertice in star {u0,u1,u2…,un} was joined with every vertice in path {v0,v1,v2…,vn} is called join graph of path Pm with star Sn and denoted by Pm∨Sn In this paper the adjacent vertex-distinguishing chromatic number of Pm V Sn has given.

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

分 类 号：O157.5[理学—数学] O122.7[理学—基础数学]