Abstract
In this paper we show that in a tree with vertex weights the vertices with the second smallest status and those with the second smallest branch-weight are the same.
Similar content being viewed by others
References
R.C. Entringer, D.E. Jackson and D.A. Snyder: Distance in graphs. Czech. Math. J. 26 (1976), 283–296.
A. Kang and D. Ault: Some properties of a centroid of a free tree. Inform. Process. Lett. 4 (1975), 18–20.
O. Kariv and S. L. Hakimi: An algorithmic approach to network location problems. II: The p-medians, SIAM J. Appl. Math. 37 (1979), 539–560.
B. Zelinka: Medians and peripherians of trees. Arch. Math. (Brno) 4 (1968), 87–95.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lin, C., Shang, JL. Statuses and branch-weights of weighted trees. Czech Math J 59, 1019–1025 (2009). https://doi.org/10.1007/s10587-009-0071-x
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10587-009-0071-x