Abstract
Let T be a tree and v a vertex in T. It is well-known that the branch-weight of v is defined as the maximum number of vertices in the components of T−v and that a vertex of T with the minimum branch-weight is called a vertex-centroid of T. Mitchell (Discrete Math. 24:277–280, 1978) introduced a type of a central vertex called the telephone center or the vertex-telecenter of a tree and showed that v is a vertex-centroid of T if and only if it is a vertex-telecenter of T. In this paper we introduce the notions of the subtree-centroid and the subtree-telecenter of a tree which are natural extensions of the vertex-centroid and the vertex-telecenter, and generalize two theorems of Mitchell (Discrete Math. 24:277–280, 1978) in the extended framework of subtree-centroids and subtree-telecenters. As a consequence of these generalized results we also obtain an efficient solution method which computes a subtree-telecenter of a tree.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Buckley, F., Harary, F.: Distance in Graphs. Addison-Wesley, Redwood City (1990)
Jordan, C.: Sur les assemblages de lignes. J. Reine Angew. Math. 70, 185–190 (1869)
Mitchell, S.L.: Another characterization of the centroid of a tree. Discrete Math. 24, 277–280 (1978)
Reid, K.B.: Centroids to centers in trees. Networks 21, 11–17 (1991)
Thwe, A.M.: Medians and branch weight centroids in graphs. Dissertation, Department of Mathematics, University of Yangon (2007)
Win, Z., Thwe, A.M.: Some extensions of Zelinka’s theorem on medians and centroids of trees. Research report 1, Department of Mathematics, University of Yangon (2010)
Zelinka, B.: Medians and peripherians of trees. Arch. Math. 4, 87–95 (1968)
Acknowledgements
Our deepest gratitude goes to Prof. Dr. Martin Grötschel for his guided optimal traveling research-person tour through the world of combinatorial optimization. We are also very thankful to the referee and editors whose comments and suggestions have improved the readability of the paper.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Win, Z., Than, C.K. (2013). From Vertex-Telecenters to Subtree-Telecenters. In: Jünger, M., Reinelt, G. (eds) Facets of Combinatorial Optimization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38189-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-38189-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38188-1
Online ISBN: 978-3-642-38189-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)