The Wiener Index of Trees with Given Degree Sequences

By Xiaodong Zhang, Qipeng Xiang, Li-Qun Xu. 2008

108 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/e1da7d5ae2b5f9caa285449084939490bf737038

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. K. C. Das
2. Boris Furtula
3. Ivan Gutman
4. Kexiang Xu
5. Nina S. Schmuck
6. Muhuo Liu
7. Stephan G. Wagner
8. Xiaodong Zhang

Citations in the corpus

• Greedy Trees, Caterpillars, and Wiener-Type Graph Invariants (2012, background): “In regard to maximizing or minimizing the above mentioned distance-based invariants over all trees with prescribed degree sequence, it has been proven that the minimum is obtained for the “greedy tree” in the cases of the Wiener [22, 23, 28] and terminal Wiener index [20].”
• Maximum Wiener Index of Trees with Given Degree Sequence (2010, background): “[32] independently characterized the tree that minimizes the Wiener index among trees of given degree sequences.”
• A Survey on Graphs Extremal with Respect to Distance-Based Topological Indices (2014, methodology): “Given the degree sequence and the number of vertices, the greedy tree minimizes the Wiener index ([134,151,170]) and also maximizes the Harary index ([149]).”