Matches in DBpedia 2016-04 for { ?s ?p "In discrete mathematics, 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 (also: centroid) 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: The tree has precisely one center (centered trees)."@en }
Showing triples 1 to 2 of
2
with 100 triples per page.
- Centered_tree comment "In discrete mathematics, 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 (also: centroid) 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: The tree has precisely one center (centered trees).".
- Q5060034 comment "In discrete mathematics, 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 (also: centroid) 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: The tree has precisely one center (centered trees).".