积图P2×C6的邻点可区别全染色  

Adjacent Vertex Distinguishing Total Coloring on the Product Graph P2 × C6

作　　者：陈纲[1] 张淑萍[2] 郑志恒[1] Chen Gang, Zhang Shuping, Zheng Zhiheng （ 1. School of Mathematics ＆ Computer, Ningxia University, Ningxia, Yinchuan, 750021 ; 2. School of Economics ＆ Management, Ningxia University, Ningxia, Yinchuan, 750021 ）

机构地区：[1]宁夏大学数学计算机学院,宁夏银川750021 [2]宁夏大学经济管理学院,宁夏银川750021

出　　处：《绍兴文理学院学报（自然科学版）》2006年第2期16-18,共3页Journal of Shaoxing College of Arts and Sciences

基　　金：宁夏大学数学计算机学院青年教师科研启动基金资助项目

摘　　要：设G是阶数不小于3的简单连通图，G的k-正常全染色σ称为是邻点可区别的，如果对G的任意相邻的两顶点，其点的颜色及关联边的颜色构成的集合不同，这样的k中最小者称为是G的邻点可区别全色数、得到了P2×C6的邻点可区别全色数．Let G be a simple connected graph. A k - proper total coloring of G is adjacent distinguishing if for arbitrary two adjacent vertices u and v, C（u） ≠ C（v） ,where C（u） is the set of the colors of u and the edge which is adjacent to u . The minimum k is called the adjacent vertex distinguishing total chromatic number of G . The adjacent vertex distinguishing total chromatic number is obtained for the product graph P2 × C6.

关 键 词：图 积图 邻点可区别全色数 

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