Some Properties of a Centroid of a Free Tree

@article{Kang1975SomePO,
  title={Some Properties of a Centroid of a Free Tree},
  author={Andy N. C. Kang and David A. Ault},
  journal={Inf. Process. Lett.},
  year={1975},
  volume={4},
  pages={18-20}
}
bt T be a free tree. The nodes in Tare denoted by small letters (possibly with a subscript) such as u, ur, etc., the edgeq are denoted by node pairs such as @,q)# an8 the distance (positive numbers) associated with the ‘edp !‘u, ui) is denoted by dt% q)w The path k#gfh lhO) is defined as the sum of edge lengths in the uniquely defined path between u and v. The total path kgth of’ T wtph wpect to u, L(u), is defined as 

2 Figures & Tables