| 关于优美树的一个结果 |
| |
| 引用本文： | 龙和平. 关于优美树的一个结果[J]. 山东大学学报(理学版), 1991, 0(4) |
| |
| 作者姓名： | 龙和平 |
| |
| 作者单位： | 山东大学数学系 |
| |
| 摘 要： | 每一棵树都是二部图,从而可把树的顶点按二部图唯一地分为二部分.本文证明一部分为5个顶点的树为优美树.
|
| 关 键 词： | 优美树 交错树 二部图 基 |
A RESULT ON GRACEFUL TREE |
| |
| Long Heping. A RESULT ON GRACEFUL TREE[J]. Journal of Shandong University, 1991, 0(4) |
| |
| Authors: | Long Heping |
| |
| Abstract: | All trees, are bigraph, we can separate the vitices of tree into two parts in the, form of bigraph. Huang and others proved that trees with at most four vitices in one part are graceful. This paper proves that the trees with five vitices in one part are graceful. |
| |
| Keywords: | graceful trees interlaced trees bigraph base |
| 本文献已被 CNKI 等数据库收录！ |
|
