The Maximum Wiener Index of Trees with Given Degree Sequences
Xiao-Dong Zhang, Yong Liu, Min-Xian Han
TL;DR
This paper investigates the maximum Wiener index achievable by trees with a specified degree sequence, correcting previous errors and identifying extremal trees that attain this maximum.
Contribution
It provides a corrected analysis of the maximum Wiener index for trees with given degree sequences and characterizes the extremal trees.
Findings
Identifies the maximum Wiener index for trees with given degree sequences.
Characterizes the extremal trees that achieve this maximum.
Corrects previous inaccuracies in the literature.
Abstract
The Wiener index of a connected graph is the sum of topological distances between all pairs of vertices. Since Wang gave a mistake result on the maximum Wiener index for given tree degree sequence, in this paper, we investigate the maximum Wiener index of trees with given degree sequences and extremal trees which attain the maximum value.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Advanced Mathematical Theories and Applications · Topological and Geometric Data Analysis