Maximum eccentric connectivity index for graphs with given diameter

DOI10.1016/J.DAM.2019.04.031MaRDI QIDQ2274082zbMATH OpenOpenAlexWikidataFDO

Authors Pierre Hauweele, Alain Hertz, Hadrien Mélot, Bernard Ries, Gauvain Devillez

Publication date 19 September 2019

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1808.10203

zbMATH Keywords

eccentric connectivity indexextremal graph theory

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Abstract: 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 $Dleqn-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$.

Recommendations

• A note on the eccentric connectivity index of graphs of given diameter
• On the maximal eccentric connectivity indices of graphs
• On the minimal eccentric connectivity indices of graphs
• On the number of vertices with specified eccentricity
• Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index

Cites work

• Complete solution to a conjecture of Zhang-Liu-Zhou
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• On the eccentric connectivity index of a graph
• On the maximal eccentric connectivity indices of graphs

Cited in

(11)

• On the difference between the eccentric connectivity index and eccentric distance sum of graphs
• On the maximal eccentric connectivity indices of graphs
• Leap eccentric connectivity index in graphs with universal vertices
• The eccentric distance sum, the Harary index and the degree powers of graphs with given diameter.
• Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant
• A note on the eccentric connectivity index of graphs of given diameter
• On the maximum connective eccentricity index among k-connected graphs
• On the number of vertices with specified eccentricity
• On the eccentric connectivity index of trees with given domination number
• Bounds for eccentricity-based parameters of graphs
• Eccentric and leap eccentric connectivity indices of some Mycielski graphs

This page was built for publication: Maximum eccentric connectivity index for graphs with given diameter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2274082)