Abstract
The Wiener index of a graph is defined as the sum of distances between all pairs of vertices. As one of the most well known chemical indices, the extremal structures that maximize or minimize the Wiener index have been extensively studied for many different classes of graphs, among which trees with a given degree sequence or segment sequence. In this note we consider trees in which both the degree sequence and segment sequence are predetermined, and examine the extremal problems. Characteristics of the extremal structures are presented, some directly from previously established methods. We also pose some questions from our study.
Original language | English |
---|---|
Pages (from-to) | 105-118 |
Number of pages | 14 |
Journal | Match |
Volume | 81 |
Issue number | 1 |
State | Published - 2019 |