On the quotients between the eccentric connectivity index and the eccentric distance sum of graphs with diameter 2 (Q2197435)

The eccentric connectivity index of a graph \(G\) is \(\xi^c(G) = \sum_{v \in V(G)}\varepsilon(v)\deg(v)\) and the eccentric distance sum is \(\xi^d(G) = \sum_{v \in V(G)}\varepsilon(v)D(v)\), where \(\varepsilon(v)\) is the eccentricity of \(v\) and \(D(v)\) the sum of distances between \(v\) and the other vertices. Answering an open problem from [\textit{H. Zhang} et al., ibid. 254, 204--221 (2019; Zbl 1404.05093)], it is proved in this note that if \(G\) is a graph of order \(n\) and with diameter \(2\), then \(3/(4n-5) \le \xi^c(G)/\xi^d(G) \le (n^2+n-6)/(n^2+n+2)\), where the left inequality is attained precisely for starts and the right inequality precisely for complete graphs minus an edge.