The adjacent vertex distinguishing total chromatic number is obtained for the flower graph.
得到了花图的邻点可区别全色数。
In this paper the total chromatic conjecture is verified to be true for complete 4-partite graph.
本文对所有4部完全图证实了全着色猜想。
The adjacent vertex distinguishing total chromatic number is obtained for the middle graphs of path, cycle, star and fan graph.
本文考虑了图的中间图的邻点可区别全色数，并确定了路、圈、星图和扇图的中间图的邻点可区别全色数。
In the sixth part, the probability estimates of vertex-adjacent vertex distinguishing total chromatic number of some graphs are discussed.
第六部分讨论图的点邻点可区别全色数的概率方法估计。
The aberration formula CIEDE2000 was used to compare further the chromatic aberration among all color samples taking the aberration at point 2 and point 3 as the standard total chromatic aberration.
应用CIEDE2000色差公式，设点2、点3的色差为标准总色差，进一步比较各颜色样本之间的色差。
The aberration formula CIEDE2000 was used to compare further the chromatic aberration among all color samples taking the aberration at point 2 and point 3 as the standard total chromatic aberration.
应用CIEDE2000色差公式，设点2、点3的色差为标准总色差，进一步比较各颜色样本之间的色差。
应用推荐