图的邻点强可区别全色数

图的染色是图论的主要内容之一，它在通讯线路的设计，算法设计与分析以及理论计算机等方面有广泛的应用。如何确定一种图染色法的色数大小，是图染色研究的主要问题。概率方法是一种研究图染色的新方法，它主要用来估计图染色法的色数的上界。利用概率方法研究了图的邻点强可区别的全染色，得到了图的邻点强可区别的全染色的一个上界。

The Adjacent Vertex Strongly Distinguishing Total Chromatic Number of the Graph

Graph coloring is one of the main contents of graph theory.It has wide applications in communication line design,algorithmic analysis, design and theory computer and so on.In recent years,more and more people the coloring.The start to study graph coloring.How to determine the probabilistic method is a new way that studies upper bounds of the the chromatic number of graph coloring.The chromatic number is the main issue in graph coloring.It mainly estimates the adjacent vertex strongly distinguishing total coloring of the graph is stuied by the probabilistic method and an upper bound of the adjacent vertex strongly distinguishing total coloring of the graph is gained.