树的第五小至第七小度距离
The Fifth to Seventh Minimal Degree Distance of the Tree
DOI: 10.12677/AAM.2019.84087, PDF,    科研立项经费支持
作者: 卓玛措, 刘淑华, 琼 吉：青海师范大学民族师范学院，青海 西宁
关键词: 图；度距离；树；排序；Graph； Degree Distance； Tree； Sorting
摘要: 图的度距离指标是图的每一个点的度与这个点到图G的所有点的距离乘积的和。何秀萍给出了n阶树中具有第一小至第四小度距离的树，并确定了其度距离。本文在对以上结果认真研究的基础上，借助图的变换，应用计算递归，研究了n阶树Tn的度距离排序问题，确定了这个序中的第五小至第七小的树，并且给出了相应的度距离。
Abstract: The degree distance indicator of the graph is the sum of the degrees of each point of the graph and the distance between the point and all points of the graph. The tree with the first small to fourth small distance in the order tree is given by He Xiuping, and its degree distance is determined. Based on the careful study of the above results, this paper studies the degree distance sorting problem of the order tree Tn by using the transformation of the graph, and determines the fifth small to seventh tree in this order, and gives the corresponding degree distance.
文章引用：卓玛措, 刘淑华, 琼吉. 树的第五小至第七小度距离[J]. 应用数学进展, 2019, 8(4): 771-779. https://doi.org/10.12677/AAM.2019.84087

参考文献

[1] Dobrynin, A.A. (1999) A Simple Formula for the Calculation of the Wiener Index of Hexagonal Chains. Computers & Chemistry, 23, 43-48. [Google Scholar] [CrossRef] 
[2] Dobrynin, A.A. and Gutman, I. (1999) The Average Wiener Index of Hexagonal Chains. Computers & Chemistry, 23, 571-576. [Google Scholar] [CrossRef] 
[3] Dobrynin, A.A. and Kochtova, A.A. (1994) Degree Distance of a Graph: A Degree Analogue of the Wiener Index. Journal of Chemical Information and Modeling, 34, 1082-1086. [Google Scholar] [CrossRef] 
[4] Gutman, I. (1994) Selected Properties of the Schultz Molecular Topological Index. Journal of Chemical Information and Modeling, 34, 1087-1089. [Google Scholar] [CrossRef] 
[5] Tomescu, I. (1999) Note Some Extremal Properties of the Degree Dis-tance of a Graph. Discrete Applied Mathematics, 98, 159-163. [Google Scholar] [CrossRef] 
[6] 陈爱莲, 何秀萍. 单圈图的度距离序[J]. 福州大学学报: 自然科学版, 2004, 32(6): 664-668.
[7] 何秀萍. 具有最小度距离的双圈图[J]. 数学研究, 2008, 41(4): 434-438.
[8] 候远, 常安. 具有最大度距离的单圈图[J]. 数学研究, 2006, 39(1): 18-24.
[9] 何秀萍. 树的度距离序[J]. 福州大学学报: 自然科学版, 2002, 30(4): 479-481.
[10] 何秀萍, 常安. 树的最大度距离排序[J]. 福州大学学报: 自然科学版, 2010, 38(5): 640-643.
[11] Tomescu, I. (1999) Some Extremal Properties of the Degree Distance of a Graph. Discrete Applied Mathematics, 98, 159-163. [Google Scholar] [CrossRef] 
[12] 李俊锋, 夏方礼. 双星树的度距离研究[J]. 邵阳学院学报: 自然科学版, 2009, 6(4): 6-8.
[13] Bond, J.A. and Murty, U.S.R. (1976) Graph Theory with Applications. Mac-Millan Press, New York.
[14] 候远, 常安. 具有最小度距离的完美匹配单圈图[J]. 福州大学学报: 自然科学版, 2008, 36(3): 323-326.

为你推荐