若干倍图的邻点可区别Ⅰ-全染色  

On a Number of Adjacent Vertex Distinguishing Ⅰ-total Coloring of Double Graph

作　　者：张淼[1] 刘焕平[1] 

机构地区：[1]哈尔滨师范大学数学科学学院,黑龙江哈尔滨150025

出　　处：《数学的实践与认识》2016年第3期209-213,共5页Mathematics in Practice and Theory

基　　金：黑龙江省自然科学基金(面上项目)(F2015012);国家自然科学基金(面上项目)(61471145)

摘　　要：通过构造邻点可区别Ⅰ-全染色函数得到了路、圈、星、扇和轮的倍图的邻点可区别Ⅰ-全色数,验证了它们满足邻点可区别Ⅰ-全染色猜想.By constructing the function of adjacent vertex distrnguistiiag Utotal coloring,the adjacent vertex distinguishing I-total chromatic number of double graph of path,circle,star,fan and wheel are discussed.Verify that they meet the adjaaeiit vertex distinguishingⅠ- total coloring conjecture.

关 键 词：倍图 邻点可区别Ⅰ-全染色 邻点可区别Ⅰ-全色数 

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