Abstract. Let G be a tree. It is proved that for any vertex v of G
in which d(q) is the degree of the vertex q, and l(v, q) is the distance
between v and q in G. This result enable us to derive a formula concering the
average distance for some particular trees.
|