The Connective Eccentricity Index of Hypergraphs

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.