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

被引：1

作者：

Cambie, Stijn ^{[1
]}

机构：

[1] Katholieke Univ Leuven, Dept Comp Sci, Campus Kulak Kortrijk, B-8500 Kortrijk, Belgium

来源：

DISCRETE APPLIED MATHEMATICS | 2024年 / 347卷

关键词：

Wiener index; Total distance; Harary index; Zagred indices; Eulerian graphs; 2-edge-connected graphs;

D O I：

10.1016/j.dam.2024.01.011

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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.

引用

页码：139 / 142

页数：4

共 8 条

[1] Harary index of Eulerian graphs [J].

Cai, Junqing ;

Wang, Panpan ;

Zhang, Linlin .

JOURNAL OF MATHEMATICAL CHEMISTRY, 2021, 59 (05) :1378-1394

[2]

Cambie S, 2021, DISCRETE MATH THEOR, V23

[3] Proof of a conjecture on the Wiener index of Eulerian graphs [J].

Dankelmann, Peter .

DISCRETE APPLIED MATHEMATICS, 2021, 301 :99-108

[4] Wiener index of Eulerian graphs [J].

Gutman, Ivan ;

Cruz, Roberto ;

Rada, Juan .

DISCRETE APPLIED MATHEMATICS, 2014, 162 :247-250

[5]

Knor M, 2023, Arxiv, DOI [arXiv:2303.11405, 10.48550/arXiv.2303.11405, DOI 10.48550/ARXIV.2303.11405]

[6] Zagreb Indices and Multiplicative Zagreb Indices of Eulerian Graphs [J].

Liu, Jia-Bao ;

Wang, Chunxiang ;

Wang, Shaohui ;

Wei, Bing .

BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2019, 42 (01) :67-78

[7] NEW BOUNDS ON ZAGREB INDICES [J].

Liu, Zhongzhu ;

Ma, Qinghua ;

Chen, Yizhi .

JOURNAL OF MATHEMATICAL INEQUALITIES, 2017, 11 (01) :167-179

[8] ON THE SUM OF ALL DISTANCES IN A GRAPH OR DIGRAPH [J].

PLESNIK, J .

JOURNAL OF GRAPH THEORY, 1984, 8 (01) :1-21

← 1 →