推广的Petersen图的相邻顶点可区分的全染色  

On Adjacent Vertex-Distinguishing Total Coloring of Generalized Petersen Graph

作　　者：王丽伟[1] 刘萍[1] 王颜妮[1] 

机构地区：[1]山东师范大学数学科学学院,山东济南250014

出　　处：《山东科学》2007年第6期4-8,共5页Shandong Science

基　　金：国家自然科学基金资助项目(60673047)

摘　　要：图的全染色概念是点染色和边染色的推广,图的所有元素(顶点和边)都将染色且任相邻或关联的元素染色不同.邻点可区分的全染色是在正常全染色的定义上,使得相邻顶点的色集不同.本文给出了推广的Petersen图的相邻顶点可区分的全染色.The Total Coloring of a graph is a generalization of the vetex and edge coloring,in which all of the elements （vertices and edges）are colored in such a way that no any two adjacent or correlative elements are colored indentically. The adjacent vertex-distinguish total coloring is a normal total coloring and the colors sets of two adjacent vertices are different. In this paper, the adjacent vertex-distinguishing total coloring numbers of generalized Petersen graph are presented.

关 键 词：邻点可区分的全染色 邻点可区分的全色数 推广的Petersen图 

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