
doi: 10.3390/math10234574
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.
hypergraphs, QA1-939, connective eccentricity index, connective eccentricity index; <i>k</i>-uniform hypertrees; hypergraphs; maximal and minimal values, <i>k</i>-uniform hypertrees, maximal and minimal values, Mathematics
hypergraphs, QA1-939, connective eccentricity index, connective eccentricity index; <i>k</i>-uniform hypertrees; hypergraphs; maximal and minimal values, <i>k</i>-uniform hypertrees, maximal and minimal values, Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
