A lower bound on the eccentric connectivity index of a graph
From MaRDI portal
Publication:765366
DOI10.1016/J.DAM.2011.09.010zbMATH Open1250.05068OpenAlexW2035675880MaRDI QIDQ765366FDOQ765366
M. J. Morgan, Simon Mukwembi, H. 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
Applications of graph theory (05C90) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Distance in graphs (05C12) Connectivity (05C40)
Cites Work
Cited In (19)
- On the general degree-eccentricity index of a graph
- Total eccentricity index of trees with fixed pendent vertices and trees with fixed diameter
- On the extremal eccentric connectivity index of graphs
- Bounds for the modified eccentric connectivity index
- Further results regarding the sum of domination number and average eccentricity
- On the quotients between the eccentric connectivity index and the eccentric distance sum of graphs with diameter 2
- On the eccentric connectivity index of uniform hypergraphs
- Title not available (Why is that?)
- Extremal graphs with respect to the total-eccentricity index
- On the extremal values of the eccentric distance sum of trees with a given maximum degree
- On the eccentric connectivity index of trees with given domination number
- Two degree-distance based topological descriptors of some product graphs
- On some bounds and exact formulae for connective eccentric indices of graphs under some graph operations
- 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
- 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 domination number
- Eccentric connectivity coindex under graph operations
- The eccentric connectivity polynomial of two classes of nanotubes
This page was built for publication: A lower bound on the eccentric connectivity index of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765366)