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
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篇论文的施引文献，订阅后可以查看论文全部施引文献