树的最大度距离排序 |
| |
引用本文: | 何秀萍,常 安.树的最大度距离排序[J].福州大学学报(自然科学版),2010,38(5):640-643. |
| |
作者姓名: | 何秀萍 常 安 |
| |
作者单位: | 福州大学离散数学研究中心, 福建 福州 350002;福州大学离散数学研究中心, 福建 福州 350002 |
| |
摘 要: | 讨论树的最大度距离排序问题,确定了这个序的前四个树及其相应的度距离.
|
关 键 词: | 度距离 树 排序 |
Ordering trees by their maximal degree distance |
| |
Institution: | Center for Discrete Mathematics and Theoretical Computer Science, Fuzhou University,
Fuzhou, Fujian 350002, China;Center for Discrete Mathematics and Theoretical Computer Science, Fuzhou University,
Fuzhou, Fujian 350002, China |
| |
Abstract: | The problem on the ordering trees by their maximal degree distance is investigated in this paper, and the first four trees in this order and the corresponding degree distance of these trees are determined. |
| |
Keywords: | |
本文献已被 CNKI 等数据库收录! |
| 点击此处可从《福州大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《福州大学学报(自然科学版)》下载免费的PDF全文 |
|