两类图的相邻顶点可区分的全染色  

The Adjacent Vertex-Distinguishing Total Coloring of Two Types of Graphs

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

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

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

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

摘　　要：图的全染色概念是点染色和边染色的推广,图的所有元素(顶点和边)都将染色且任相邻或关联的元素染色不同.邻点可区分的全染色是在正常全染色的定义上,使得相邻顶点的色集(C(v))不同.本文给出了Pn,Sn及其构造:Hajós sum,部分点替换图的邻点可区别的相邻顶点可区分的全染色.The total coloring is a generalization of the dot and edge coloring, and all of the elements （vertices and edges）of a graph are colored in such a way that no two adjacent or incident elements are colored identically. The adjacent vertex-distinguish total coloring is a total colors and the colors sets of two adjacent vertices are different.The adjacent vertex-distinguishing total coloring numbers of graph P^n, Sn, their Hajós sum and part of the substituted graphs of vertices are given in this paper.

关 键 词：邻点可区分的全染色 邻点可区分的全色数 Hajós SUM 部分点替换图 P^n Sn 

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