【摘要】 提出了图的邻点可区别Ⅰ-均匀全染色的概念,研究了它的一些性质,并给出了路、圈、扇、轮、完全图、完全二部图等的邻点可区别Ⅰ-均匀全色数.进而提出了图的邻点可区别Ⅰ-均匀全色数都不会超过△+2的猜想.更多还原

【Abstract】 The concept of incidence-adjacent vertex distinguishing equitable total coloring of a graph is proposed.Some properties of the incidence-adjacent vertex distinguishing equitable 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.更多还原