中间图的邻点可区别全染色  

Adjacent Vertex Distinguishing Total Coloring on the Middle Graphs

作　　者：陈纲[1] 赵科军[2] 

机构地区：[1]宁夏大学数学计算机学院,宁夏银川750021 [2]宁夏教育考试院,宁夏银川750004

出　　处：《漳州师范学院学报（自然科学版）》2009年第2期10-14,共5页Journal of ZhangZhou Teachers College（Natural Science)

基　　金：宁夏大学科研基金资助项目(ZR200827)

摘　　要：设G是简单连通图,G的k-正常全染色f称为是邻点可区别的,如果对G的任意相邻的两顶点,其点的颜色及关联边的颜色构成的集合不同,称f为G的k-邻点可区别全染色.这样的k中最小者称为G的邻点可区别全色数.本文考虑了图的中间图的邻点可区别全色数,并确定了路、圈、星图和扇图的中间图的邻点可区别全色数.Let G be a simple connected graph..A If-proper total coloring of G is called 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 edges which is adjacent to u. The minimum If such that G has a k -adjacent-vertex-distinguishing total coloring is called the adjacent vertex distinguishing total chromatic number. The adjacent vertex distinguishing total chromatic number is obtained for the middle graphs of path, cycle, star and fan graph.

关 键 词：正常全染色 邻点可区别全染色 邻点可区别全染色数 中间图 

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