Eccentricity sums in trees

Heather Smith, László Székely, Hua Wang

Research output: Contribution to journalArticlepeer-review

23 Scopus citations

Abstract

The eccentricity of a vertex, eccT(v)=maxu∈TdT(v,u), was one of the first, distance-based, tree invariants studied. The total eccentricity of a tree, Ecc(T), is the sum of the eccentricities of its vertices. We determine extremal values and characterize extremal tree structures for the ratios Ecc(T)/eccT(u), Ecc(T)/eccT(v), eccT(u)/eccT(v), and eccT(u)/eccT(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.

Original languageEnglish
Pages (from-to)120-131
Number of pages12
JournalDiscrete Applied Mathematics
Volume207
DOIs
StatePublished - Jul 10 2016

Scopus Subject Areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Keywords

  • Degree sequence
  • Eccentricity
  • Extremal problems
  • Greedy caterpillar
  • Greedy tree
  • Level-greedy tree

Fingerprint

Dive into the research topics of 'Eccentricity sums in trees'. Together they form a unique fingerprint.

Cite this