English

Eccentricity Sums in Trees

Combinatorics 2015-05-12 v2

Abstract

The eccentricity of a vertex, eccT(v)=maxuTdT(v,u)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)Ecc(T), is the sum of eccentricities of its vertices. We determine extremal values and characterize extremal tree structures for the ratios Ecc(T)/eccT(u)Ecc(T)/ecc_T(u), Ecc(T)/eccT(v)Ecc(T)/ecc_T(v), eccT(u)/eccT(v)ecc_T(u)/ecc_T(v), and eccT(u)/eccT(w)ecc_T(u)/ecc_T(w) where u,wu,w are leaves of TT and vv is in the center of TT. In addition, we determine the tree structures that minimize and maximize total eccentricity among trees with a given degree sequence.

Keywords

Cite

@article{arxiv.1408.5865,
  title  = {Eccentricity Sums in Trees},
  author = {Heather Smith and László Székely and Hua Wang},
  journal= {arXiv preprint arXiv:1408.5865},
  year   = {2015}
}
R2 v1 2026-06-22T05:39:07.075Z