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, 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.
Attributes | Values |
---|
rdf:type
| |
rdfs:label
| |
rdfs:comment
| - 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, 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. (en)
|
foaf:depiction
| |
dcterms:subject
| |
Wikipage page ID
| |
Wikipage revision ID
| |
Link from a Wikipage to another Wikipage
| |
Link from a Wikipage to an external page
| |
sameAs
| |
dbp:wikiPageUsesTemplate
| |
thumbnail
| |
title
| - Bicentered Tree (en)
- Centered Tree (en)
|
urlname
| - BicenteredTree (en)
- CenteredTree (en)
|
has abstract
| - 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, 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. (en)
|
gold:hypernym
| |
prov:wasDerivedFrom
| |
page length (characters) of wiki page
| |
foaf:isPrimaryTopicOf
| |
is Link from a Wikipage to another Wikipage
of | |
is Wikipage redirect
of | |
is foaf:primaryTopic
of | |