A note on the eccentric connectivity index of graphs of given diameter

被引：0
作者：
du Toit, Lindie [1 ]
Mukwembi, Simon [2 ,3 ]
Vetrik, Tomas [4 ]
机构：
[1] Univ Pretoria, Dept Math & Appl Math, Pretoria, South Africa
[2] Univ KwaZulu Natal, Sch Math Stat & Comp Sci, Durban, South Africa
[3] Univ Zimbabwe, Dept Math, Harare, Zimbabwe
[4] Univ Free State, Dept Math & Appl Math, Bloemfontein, South Africa
来源：
UTILITAS MATHEMATICA | 2020年 / 115卷
基金：
芬兰科学院; 新加坡国家研究基金会;
关键词：
eccentric connectivity index; diameter; eccentricity;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The eccentric connectivity index of a graph G is defined as ECI(G) = Sigma(v is an element of V(G)) ec(v)deg(v), where V(G) is the vertex set of G, deg(v) is the degree of a vertex v and ec(v) is the eccentricity of v. The eccentric connectivity index of various graphs has been extensively studied especially in the last decade. We present upper bounds on the eccentric connectivity index for graphs of given order and fixed diameter. We also show that our bounds are asymptotically sharp.
引用
收藏
页码：267 / 274
页数：8
相关论文
共 12 条
12