Centered tree
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In the mathematical subfield of graph theory, a centered tree is a tree with only one center, and a bicentered tree is a tree with two centers. Given a graph, the eccentricity of a vertex is defined as the greatest distance from to any other vertex. A center of a graph is a vertex with minimal eccentricity. A graph can have an arbitrary number of centers. However, has proved that for trees, there are only two possibilities: # The tree has precisely one center (centered trees). # The tree has precisely two centers (bicentered trees). In this case, the two centers are adjacent. A proof of this fact is given, for example, by Harary.
In the mathematical subfield of graph theory, a centered tree is a tree with only one center, and a bicentered tree is a tree with two centers. Given a graph, the eccentricity of a vertex is defined as the greatest distance from to any other vertex. A center of a graph is a vertex with minimal eccentricity. A graph can have an arbitrary number of centers. However, has proved that for trees, there are only two possibilities: The tree has precisely one center (centered trees). The tree has precisely two centers (bicentered trees). In this case, the two centers are adjacent. A proof of this fact is given, for example, by Harary.
Notes
References
External links
Text derived from https://en.wikipedia.org/w/index.php?oldid=1254771184 under CC BY-SA 4.0; modifications have been made.