Corrigendum on Wiener index, Zagreb Indices and Harary index of Eulerian graphs

In the original article (Gutman et al., 2014), the authors state that the Wiener index (total distance) of an Eulerian graph is maximized by the cycle. We explain that the initial proof contains a flaw and note that it is a corollary of a result by Plesnik, since an Eulerian graph is 2 -edge -connected. The same incorrect proof is used in two referencing papers, (Liu et al., 2019) and (Cai et al., 2021). We give proofs of the main results of those papers and the 2 -edge -connected analogues. (c) 2024 Elsevier B.V. All rights reserved.