图的邻点强可区别全色数的新上界  

A New Upper Bound for Adjacent Vertex Strongly Distinguishing Total Chromatic Number

作　　者：陆尚辉[1] 

机构地区：[1]中央民族大学理学院,北京100081

出　　处：《中央民族大学学报（自然科学版）》2013年第1期79-82,共4页Journal of Minzu University of China(Natural Sciences Edition)

摘　　要：图的染色是图论研究的热点和难点之一,本文在前人研究的基础上应用待定系数法和概率方法研究了图的邻点强可区别全染色,得到了一个新的色数上界.即证明了对任意最大度Δ≥2的图G,χast≤32Δ.：Graph coloring is one of the difficult issue research in the graph theory. This paper is on the basis of previous studies and use application undetermined coefficient method and probability method to research the adjacent vertex strongly distinguishing total coloring,then a new upper bound of the adjacent vertex strongly distinguishing total chromatic number of the graph is gained.

关 键 词：图论 概率方法 邻点强可区别全染色 

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