图的邻点可区别Ⅰ-均匀全染色  

Incidence-Adjacent Vertex Distinguishing Equitable Total Coloring of Graphs

作　　者：王继顺[1] 李步军[2] 

机构地区：[1]连云港师范高等专科学校数学与信息工程学院,连云港222006 [2]淮海工学院数理科学系,连云港222006

出　　处：《应用数学学报》2015年第1期125-136,共12页Acta Mathematicae Applicatae Sinica

基　　金：国家自然科学基金(61170302);连云港市第五期"521高层次人才培养工程"培养对象资助项目

摘　　要：提出了图的邻点可区别Ⅰ-均匀全染色的概念,研究了它的一些性质,并给出了路、圈、扇、轮、完全图、完全二部图等的邻点可区别Ⅰ-均匀全色数.进而提出了图的邻点可区别Ⅰ-均匀全色数都不会超过△+2的猜想.The concept of incidence-adjacent vertex distinguishing equitable total coloring of a graph is proposed. Some properties of the incidence-adjacent vertex distinguishing equi- table total coloring of graphs are discussed and the incidence-adjacent vertex distinguishing equitable total chromatic numbers of some graphs, such as path, cycle, fan, wheel, complete graph, complete bipartite graph, and so on are investigated. And a conjecture is given by us which the incidence-adjacent vertex distinguishing equitable total chromatic number of a graph is no more than A＋2.

关 键 词：邻点可区别I-全染色 邻点可区别I-均匀全染色 邻点可区别I-均匀全色数 

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