A lower bound on the eccentric connectivity index of a graph
From MaRDI portal
Publication:765366
DOI10.1016/j.dam.2011.09.010zbMath1250.05068OpenAlexW2035675880MaRDI QIDQ765366
M. J. Morgan, Simon Mukwembi, Henda C. Swart
Publication date: 19 March 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.09.010
Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Distance in graphs (05C12) Connectivity (05C40) Vertex degrees (05C07)
Related Items (15)
On the general degree-eccentricity index of a graph ⋮ Two degree-distance based topological descriptors of some product graphs ⋮ On the quotients between the eccentric connectivity index and the eccentric distance sum of graphs with diameter 2 ⋮ Unnamed Item ⋮ Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index ⋮ On the minimal eccentric connectivity indices of bipartite graphs with some given parameters ⋮ Further results regarding the sum of domination number and average eccentricity ⋮ The eccentric connectivity polynomial of two classes of nanotubes ⋮ On the extremal values of the eccentric distance sum of trees with a given domination number ⋮ Eccentric connectivity coindex under graph operations ⋮ On the eccentric connectivity index of uniform hypergraphs ⋮ Total eccentricity index of trees with fixed pendent vertices and trees with fixed diameter ⋮ Extremal trees of given segment sequence with respect to some eccentricity-based invariants ⋮ On the extremal values of the eccentric distance sum of trees with a given maximum degree ⋮ On the extremal eccentric connectivity index of graphs
Cites Work
This page was built for publication: A lower bound on the eccentric connectivity index of a graph
