Английская Википедия:Centered tree

Материал из Онлайн справочника
Перейти к навигацииПерейти к поиску

Шаблон:Short description Шаблон:Use American English Шаблон:Use mdy dates

Файл:Centered tree.gif
On the left a centered tree, on the right a bicentered one. The numbers show each node's eccentricity.

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 Шаблон:Mvar is defined as the greatest distance from Шаблон:Mvar 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, Шаблон:Harvtxt 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

  1. Шаблон:Harv, Theorem 4.2

References

External links

Шаблон:Graph-stub