On the quotients between the eccentric connectivity index and the eccentric distance sum of graphs with diameter 2
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.
- On the difference between the eccentric connectivity index and eccentric distance sum of graphs
- On the eccentric connectivity index of a graph
- Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index
- A note on the eccentric connectivity index of graphs of given diameter
- On the minimal eccentric connectivity indices of graphs
- A lower bound on the eccentric connectivity index of a graph
- Application of graph theory: Relationship of eccentric connectivity index and Wiener's index with anti-inflammatory activity
- Eccentric Connectivity Index of Chemical Trees
- Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index
- Extremal values on the eccentric distance sum of trees
- Further results on the eccentric distance sum
- Graph theory with applications
- On eccentric distance sum and degree distance of graphs
- On the eccentric connectivity index of a graph
- On the eccentric distance sum of graphs
- The relationship between the eccentric connectivity index and Zagreb indices
- On the difference between the eccentric connectivity index and eccentric distance sum of graphs
- Multiplicative version of eccentric connectivity index
- Extremal graphs with respect to two distance-based topological indices
- The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs
- On the eccentric connectivity index of \(k\)-uniform hyper-cacti
- The eccentric distance sum, the Harary index and the degree powers of graphs with given diameter.
- On the relation between degree distance and eccentric connectivity index
- The difference between the eccentric distance sum and eccentric connectivity index.
- scientific article; zbMATH DE number 6296695 (Why is no real title available?)
- Some sufficient conditions for graphs to be k-leaf-connected
- On the eccentric connectivity index of trees with given domination number
- Comparing Wiener complexity with eccentric complexity
This page was built for publication: On the quotients between the eccentric connectivity index and the eccentric distance sum of graphs with diameter 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197435)
