摘要
图的调和着色数是安排于图的顶点使邻接的顶点有不同的着色、不同的边有不同的色对所需的最小着色数。本文给出了五元完全树的调和着色数的比较好的估计.
The harmonious chromatic number of a graph G is the least number of colors which can be assigned to the vertices of G such that adjacent vertices are colored differently and any two distinct edges have different color pairs. In this paper a estimate of the harmonious chromatic number of a complete 5-ary tree was given.
关键词
图
五元完全树
色
调和着色数
邻接
graph, complete 5-ary tree, color, harmonious chromatic number, adjacent.
