The Connective Eccentricity Index of Hypergraphs

Author:

Yu Guihai,Wu RenjieORCID,Li XingfuORCID

Abstract

The connective eccentricity index (CEI) of a hypergraph G is defined as ξce(G)=∑v∈V(G)dG(v)εG(v), where εG(v) and dG(v) denote the eccentricity and the degree of the vertex v, respectively. In this paper, we determine the maximal and minimal values of the connective eccentricity index among all k-uniform hypertrees on n vertices and characterize the corresponding extremal hypertrees. Finally, we establish some relationships between the connective eccentricity index and the eccentric connectivity index of hypergraphs.

Funder

National Natural Science Foundation of China

Guizhou Talent Development Project in Science and Technology

Natural Science Foundation of Guizhou

Guizhou outstanding young scientific and Technological Talents Program

Science Foundation of Guizhou University of Finance and Economics

Publisher

MDPI AG

Subject

General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)

Reference31 articles.

1. Applications of graph theory in chemistry;Balaban;J. Chem. Inf. Comput. Sci.,1985

2. Wiener index of trees: Theory and applications;Dobrynin;Acta Appl. Math.,2001

3. The Winner index of uniform hypergraphs;Guo;MATCH Commun. Math. Comput. Chem.,2017

4. On the Wiener index of trees with fixed diameter;Liu;MATCH Commun. Math. Comput. Chem.,2008

5. The Wiener index of hypergraphs;Guo;J. Comb. Optim.,2020

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3