A Note on the Maximal Wiener Index of Trees with Given Number of Vertices of Maximum Degree

作者：Lin, Hong^*

来源：MATCH-Communications in Mathematical and in Computer Chemistry, 2014, 72(3): 783-790.

• ODD

The Wiener index of a connected graph is defined as the sum of the distances between all unordered pairs of its vertices. Let MTn,k be the set of trees of order n with exactly k vertices of maximum degree. In this note, we characterize the trees with the maximal Wiener index in MTn,k.

• 出版日期2014
• 单位集美大学