Skip to main content
Log in

Statuses and branch-weights of weighted trees

  • Published:
Czechoslovak Mathematical Journal Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. R.C. Entringer, D.E. Jackson and D.A. Snyder: Distance in graphs. Czech. Math. J. 26 (1976), 283–296.

    MathSciNet  Google Scholar 

  2. A. Kang and D. Ault: Some properties of a centroid of a free tree. Inform. Process. Lett. 4 (1975), 18–20.

    Article  MATH  MathSciNet  Google Scholar 

  3. 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.

    Article  MATH  MathSciNet  Google Scholar 

  4. B. Zelinka: Medians and peripherians of trees. Arch. Math. (Brno) 4 (1968), 87–95.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chiang Lin.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10587-009-0071-x

Keywords

MSC 2000

Navigation