On the distance distribution of trees

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


Let G be a tree and k a non-negative integer. We determine best possible upper and lower bounds on the number of pairs of vertices at distance exactly k in G in terms of order alone, and in terms of order and radius or diameter.

Original languageEnglish
Pages (from-to)945-952
Number of pages8
JournalDiscrete Applied Mathematics
Issue number10
Publication statusPublished - 28 Jun 2011
Externally publishedYes


  • Diameter
  • Distance
  • Distance distribution
  • Radius
  • Tree

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'On the distance distribution of trees'. Together they form a unique fingerprint.

Cite this