| 五元完全树的调和着色数 |
| |
| 引用本文： | 卢志康.五元完全树的调和着色数[J].杭州师范学院学报(社会科学版),1993(3). |
| |
| 作者姓名： | 卢志康 |
| |
| 作者单位： | 杭州师范学院数学系 |
| |
| 摘 要： | 图的调和着色数是安排于图的顶点使邻接的顶点有不同的着色、不同的边有不同的色对所需的最小着色数。本文给出了五元完全树的调和着色数的比较好的估计.
|
| 关 键 词： | 图 五元完全树 色 调和着色数 邻接 |
THE HARMONIOUS CHROMATIC NUMBER OF A COMPLETE 5-ARY TREE |
| |
| Lu Zhikang.THE HARMONIOUS CHROMATIC NUMBER OF A COMPLETE 5-ARY TREE[J].Journal of Hangzhou Teachers College(Humanities and Social Sciences),1993(3). |
| |
| Authors: | Lu Zhikang |
| |
| Institution: | Department of Mathematics |
| |
| Abstract: | 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. |
| |
| Keywords: | graph complete 5-ary tree color harmonious chromatic number adjacent |
| 本文献已被 CNKI 等数据库收录！ |
