许克祥

个人信息Personal Information

教授 博士生导师

招生学科专业:
数学 -- 【招收博士、硕士研究生】 -- 数学学院

毕业院校:南京师范大学

学历:南京师范大学

学位:理学博士学位

所在单位:数学学院

办公地点:南京航空航天大学理学楼275房间

联系方式:xkx_seu@126.com

电子邮箱:

扫描关注

论文成果

当前位置: 中文主页 >> 科学研究 >> 论文成果

On two eccentricity-based topological indices of graphs

点击次数:

所属单位:理学院

发表刊物:DISCRETE APPLIED MATHEMATICS

关键字:Eccentricity Eccentric connectivity index Connective eccentricity index Diameter

摘要:For a connected graph G, the eccentric connectivity index (ECI) and connective eccentricity index (CEI) of G are, respectively, defined as xi(c)(G) = Sigma(vi is an element of V(G)) deg(G)(v(i))epsilon(G)(v(i)), xi(ce)(G) = Sigma(vi is an element of V(G)) deg(G)(v(i))/epsilon(G)(v(i)) where deg(G)(v(i)) is the degree of v(i) in G and epsilon(G)(v(i)) denotes the eccentricity of vertex v(i) in G. In this paper we study on the difference of ECI and CEI of graphs G, denoted by xi(D)(G) = xi(c)(G) - xi(ce)(G). We determine the upper and lower bounds on xi(D)(T) and the corresponding extremal trees among all trees of order n. Moreover, the extremal trees with respect to xi(D) are completely characterized among all trees with given diameter d. And we also characterize some extremal general graphs with respect to xi(D). Finally we propose that some comparative relations between CEI and ECI are proposed on general graphs with given number of pendant vertices. (C) 2017 Elsevier B.V. All rights reserved.

ISSN号:0166-218X

是否译文:

发表时间:2017-12-31

合写作者:Alizadeh, Yaser,Das, Kinkar Ch.

通讯作者:许克祥