Article ID Journal Published Year Pages File Type
418573 Discrete Applied Mathematics 2011 8 Pages PDF
Abstract

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

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
On the distance distribution of trees
Authors
,