Hauweele, Pierre Hertz, Alain Mélot, Hadrien Ries, Bernard Devillez, Gauvain 2019 The eccentricity of a vertex v in a graph G is the maximum distance between v and any other vertex of G. The diameter of a graph G is the maximum eccentricity of a vertex in G. The eccentric connectivity index of a connected graph is the sum over all vertices of the product between eccentricity and degree. Given two integers n and D with D ≤ n−1, we characterize those graphs which have the largest eccentric connectivity index among all connected graphs of order n and diameter D. As a corollary, we also characterize those graphs which have the largest eccentric connectivity index among all connected graphs of a given order n. application/pdf https://sonar.ch/global/documents/308059 https://sonar.ch/documents/308059/files/eccentricitycopy.pdf eng info:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2019.04.031 info:eu-repo/semantics/openAccess License undefined Discrete Applied Mathematics. - 2019, vol. 268, p. 102-111 extremal graph theory info:eu-repo/classification/udc/004 Maximum eccentric connectivity index for graphs with given diameter http://purl.org/coar/resource_type/c_6501