Name
Abstract | ||
|---|---|---|
A cactus is a connected graph in which any two cycles have at most one common vertex. Let & 39;n be the set of all n-vertex cacti with circumference at least 4. In Klavar et al. (2018), the authors proved that the minimum and the second minimum values on the difference between the Szeged index and the Wiener index of graphs among & 39;n are 2n & minus; 5 and 4n & minus; 10, respectively. In this paper, we give a counterexample to show that the second result is not true and we determine the second minimum value on the difference between the Szeged index and the Wiener index of graphs among & 39;n. (c) 2022 Elsevier B.V. All rights reserved. <comment>Superscript/Subscript Available</comment |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1016/j.dam.2021.12.030 | DISCRETE APPLIED MATHEMATICS |
Keywords | DocType | Volume |
Wiener index, Szeged index, Extremal graph, Cactus | Journal | 311 |
ISSN | Citations | PageRank |
0166-218X | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Min Wang | 1 | 76 | 27.77 |
| Mengmeng Liu | 2 | 0 | 0.34 |