Centered tree

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.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 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 v is defined as the greatest distance from v 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, Jordan (1869) has proved that for trees, there are only two possibilities:

  1. The tree has precisely one center (centered trees).
  2. 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.[1]

Notes

edit edit source
  1. ^ (Harary 1969), Theorem 4.2 Wikipedia revision 1254771184, retrieved 2026-11-18

References

edit edit source edit edit source

Text derived from https://en.wikipedia.org/w/index.php?oldid=1254771184 under CC BY-SA 4.0; modifications have been made.