---
title: Centered tree
slug: centered-tree
qid: 
snapshot: enwiki-001254771184
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1254771184
tags: [22915279, 22961512, 23468805, 23603337, 26220375, 28924286, 29176683, 30525120, 68328988]
---

# Centered tree

> [!note] Provenance
> Snapshot `enwiki-001254771184` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1254771184> · Licensed CC BY-SA 4.0

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==
