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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
