Name
Title | ||
|---|---|---|
Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs. |
Abstract | ||
|---|---|---|
Wiener index, defined as the sum of distances between all unordered pairs of vertices, is one of the most popular molecular descriptors. It is well known that among 2-vertex connected graphs on n≥3 vertices, the cycle Cn attains the maximum value of Wiener index. We show that the second maximum graph is obtained from Cn by introducing a new edge that connects two vertices at distance two on the cycle if n≠6. If n≥11, the third maximum graph is obtained from a 4-cycle by connecting opposite vertices by a path of length n−3. We completely describe also the situation for n≤10. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.dam.2020.03.032 | Discrete Applied Mathematics |
Keywords | DocType | Volume |
Wiener index,2-vertex connected graphs,Gross status,Distance,Transmission | Journal | 284 |
ISSN | Citations | PageRank |
0166-218X | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stéphane Bessy | 1 | 117 | 19.68 |
| François Dross | 2 | 10 | 5.83 |
| Martin Knor | 3 | 119 | 28.90 |
| Riste Škrekovski | 4 | 607 | 83.39 |