2017/02/15 by Tang, Zikai, Jiang, Lingyao, Deng, Hanyuan
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1702.04608
The connective eccentricity index ξce=∑u∈ V(d(u))/(ε(u)), where ε(u) and d(u) denote the eccentricity and the degree of the vertex u, respectively. In this paper, we first determine the extremal trees which minimize and maximize the connective eccentricity index among all trees with a given degree sequence, and then determine the extremal trees which minimize and maximize the connective eccentricity index among all trees with a given number of branching vertices.