图P_n∨K_(m,n)的均匀全色数  

On the equitable total chromatic number of P_n∨K_(m,n)

作　　者：朱俊蕾[1] 卜月华[1] 

机构地区：[1]浙江师范大学数理与信息工程学院,浙江金华321004

出　　处：《浙江师范大学学报（自然科学版）》2007年第1期58-64,共7页Journal of Zhejiang Normal University:Natural Sciences

基　　金：国家自然科学基金资助项目(10471131);浙江省自然科学基金资助项目(Y604167)

摘　　要：对于图G(V,E)的正常k-全染色f称为G(V,E)的k-均匀全染色,当且仅当任意2个色类中的元素总数至多相差1.eχt(G)=min{k|G有k-均匀全染色}称为G的均匀全色数.利用均匀边染色的相关结论,探讨了路Pn与完全二部图Km,n的联图Pn∨Km,n的均匀全色数.A proper k-total coloring fof G（ V,E ） is said to be a k-equitable total coloring of graph G（ V,E}, if the number of vertices and edges in any two color classes differ at most one. Xet （ G ） = min { k ｜ G has a k-equitable total coloring ｜ is called the equitable total chromatic number of G. The equitable total chromatic number of Pn V Km,n was showed by applying some results about the equitable edge coloring.

关 键 词：路 完全二部图 联图 均匀全色数 

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