| 树按Wiener指标的排序 |
| |
| 引用本文： | 郭晓峰,董哈微.树按Wiener指标的排序[J].厦门大学学报(自然科学版),2005,44(3):297-298. |
| |
| 作者姓名： | 郭晓峰 董哈微 |
| |
| 作者单位： | 厦门大学数学科学学院,福建,厦门,361005 |
| |
| 基金项目： | 国家自然科学基金(10331020)资助 |
| |
| 摘 要： | n个顶点的树的集合记为Fn,连通图G的Wiener指标等于图G中任意两点的距离和．本考虑．Fn中树的按Wiener指标排序的问题．先对Fn中树按非悬挂边的数目分类．确定出具有1条非悬挂边．2条非悬挂边．和3条非悬挂边的树包括的图类．根据Wiener指标的计算公式及中提到的变换方式．得到这些图类的序关系．基于这些序关系．确定了Fn中具有最小Wiener指标的前15个树．
|
| 关 键 词： | r指标 排序 悬挂边 计算公式 序关系 图G 集合 顶点 距离 连通 |
| 文章编号： | 0438-0479(2005)03-0297-02 |
| 修稿时间： | 2005年1月20日 |
Ordering Trees by Their Wiener Indices |
| |
| GUO Xiao-feng,DONG Ha-wei.Ordering Trees by Their Wiener Indices[J].Journal of Xiamen University(Natural Science),2005,44(3):297-298. |
| |
| Authors: | GUO Xiao-feng DONG Ha-wei |
| |
| Abstract: | The set of trees with n vertices is denoted byT_n .In this paper,the problem of ordering trees inT_n by their Wiener indices is considered.At first,a partition for trees inT_n is given by the number of nonpendent edges.And the trees with one nonpendent edge,two nonpendent edges,and three nonpendent edges,respectively,contain four kinds of trees.According to the calculation formular and transformation,some order relations of these four kinds of trees inT_n are obtained. Base on the order relations,the trees inT_n with the first up to fifteenth smallest Wiener indices are determined. |
| |
| Keywords: | order tree Wiener index |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
