得到了花图的邻点可区别全色数。
The adjacent vertex distinguishing total chromatic number is obtained for the flower graph.
第六部分讨论图的点邻点可区别全色数的概率方法估计。
In the sixth part, the probability estimates of vertex-adjacent vertex distinguishing total chromatic number of some graphs are discussed.
本文考虑了图的中间图的邻点可区别全色数，并确定了路、圈、星图和扇图的中间图的邻点可区别全色数。
The adjacent vertex distinguishing total chromatic number is obtained for the middle graphs of path, cycle, star and fan graph.
应用推荐