
arXiv: 1408.5865
The eccentricity of a vertex, $ecc_T(v) = \max_{u\in T} d_T(v,u)$, was one of the first, distance-based, tree invariants studied. The total eccentricity of a tree, $Ecc(T)$, is the sum of eccentricities of its vertices. We determine extremal values and characterize extremal tree structures for the ratios $Ecc(T)/ecc_T(u)$, $Ecc(T)/ecc_T(v)$, $ecc_T(u)/ecc_T(v)$, and $ecc_T(u)/ecc_T(w)$ where $u,w$ are leaves of $T$ and $v$ is in the center of $T$. In addition, we determine the tree structures that minimize and maximize total eccentricity among trees with a given degree sequence.
degree sequence, Extremal problems in graph theory, eccentricity, greedy caterpillar, Education, Trees, extremal problems, greedy tree, level-greedy tree, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 05C05, 05C12, 05C35, Mathematics, Eccentricity Sums
degree sequence, Extremal problems in graph theory, eccentricity, greedy caterpillar, Education, Trees, extremal problems, greedy tree, level-greedy tree, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 05C05, 05C12, 05C35, Mathematics, Eccentricity Sums
| 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). | 19 | |
| 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). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
