摘要
设k是一个正整数,在含有n个顶点的路Pn=v1v2…vn上,当且仅当两点的距离为k(k≥2)时增加一条边,这样所得到的图叫做Pnk(v1,vn),有时Pkn(v1,vn)也简记为Pnk.论文研究图Pnk的点着色、边着色和点、边全着色,得到图Pnk的点色数、边色数和图Pnk满足点、边全着色猜想等结论.
As k is integer , in a rote Pn = v1v2…Vn ofn vertex, the graph was called Pn^k（v1 ,vn） , if and only if the distance of two vertex was k（ k ≥ 2） , there was a edge in the two vertex. The vertex colouring,edge colouring and vertex-edge total colouring of graph Pn^k were studied in the paper. We obtained the vertex chromatic number and edge chromatic number of the graph Pn^k , and the total colouring conjecture was ture at the graph Pn^k ,etc.
出处
《安徽大学学报（自然科学版）》
CAS
北大核心
2008年第6期21-23,共3页
Journal of Anhui University(Natural Science Edition)
基金
汕头职业技术学院课题立项基金资助项目(0511214(4))
关键词
点色数
边色数
点、边全着色
图Pnk
vertex chromatic number
edge chromatic number
vertex-edge total colouring
graph Pn^k
