Skip to main content
Log in

Clarification of the Properties of a Tree Centroid

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

This paper is devoted to clarification of tree centroid properties. The authors attention was drawn to the popular problem of a (binary) partition of a graph, whose solution is known only by a brute force algorithm. It was found that for an “efficient” partition of the tree, it makes sense to consider partitions in the neighborhood of centroid vertices, the definition of which is presented. In the paper, we proposed proofs connected with the limitation of their weight. It is also proven that if there are two centroid vertices in a tree, they are adjacent. In what follows, it is noted that three such vertices cannot be in a tree. The corresponding statements are made. According to the first one, any vertex of a tree with a certain restriction on its weight is a centroid. According to one of the points of the second statement, if there are two centroid vertices in a tree, the order of the tree is an even number. The third statement says that if a tree has a centroid vertex of limited weight, there is another centroid vertex of the same weight, adjacent to the first one. To prove these statements, we consider a branch of the greatest weight with a centroid vertex and take another vertex adjacent to the centroid in this branch. In this paper, Jordan’s theorem is used; three images are used to illustrate the material.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Fig. 1.
Fig. 2.
Fig. 3.

Similar content being viewed by others

REFERENCES

  1. Yevstigneev, V.A. and Kas’anov, V.N., Teoriya grafov. Algoritmy obrabotki derev’ev (Graph Theory. Tree Processing Algorithms), Novosibirsk: Nauka, 1994.

  2. Lovasz, L. and Plummer, M.D., Matching Theory, Budapest: Akademiai Kiado, 1986.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Y. A. Belov.

Additional information

Translated by A. Dunaeva

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Belov, Y.A., Vovchok, S.I. Clarification of the Properties of a Tree Centroid. Aut. Control Comp. Sci. 52, 634–637 (2018). https://doi.org/10.3103/S0146411618070040

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411618070040

Keywords:

Navigation