| http://dbpedia.org/ontology/abstract
|
In the mathematical subfield of graph theo … 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.his fact is given, for example, by Harary.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/Centered_tree.gif?width=300 +
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
http://resolver.sub.uni-goettingen.de/purl%3FGDZPPN002153998 +
|
| http://dbpedia.org/ontology/wikiPageID
|
4557120
|
| http://dbpedia.org/ontology/wikiPageLength
|
1936
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1093345758
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Graph_center +
, http://dbpedia.org/resource/Journal_f%C3%BCr_die_reine_und_angewandte_Mathematik +
, http://dbpedia.org/resource/Category:Trees_%28graph_theory%29 +
, http://dbpedia.org/resource/File:Centered_tree.gif +
, http://dbpedia.org/resource/Distance_%28graph_theory%29 +
, http://dbpedia.org/resource/Tree_%28graph_theory%29 +
, http://dbpedia.org/resource/Mathematical +
, http://dbpedia.org/resource/Vertex_%28graph_theory%29 +
, http://dbpedia.org/resource/Graph_Theory +
, http://dbpedia.org/resource/Graph_theory +
|
| http://dbpedia.org/property/title
|
Centered Tree
, Bicentered Tree
|
| http://dbpedia.org/property/urlname
|
BicenteredTree
, CenteredTree
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Cite_journal +
, http://dbpedia.org/resource/Template:Cite_book +
, http://dbpedia.org/resource/Template:Harvtxt +
, http://dbpedia.org/resource/Template:Use_American_English +
, http://dbpedia.org/resource/Template:Use_mdy_dates +
, http://dbpedia.org/resource/Template:MathWorld +
, http://dbpedia.org/resource/Template:Topology-stub +
, http://dbpedia.org/resource/Template:Short_description +
, http://dbpedia.org/resource/Template:Mvar +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Trees_%28graph_theory%29 +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Tree +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Centered_tree?oldid=1093345758&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/Centered_tree.gif +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Centered_tree +
|
| owl:sameAs |
https://global.dbpedia.org/id/4gz8d +
, http://www.wikidata.org/entity/Q5060034 +
, http://rdf.freebase.com/ns/m.0c8rjx +
, http://dbpedia.org/resource/Centered_tree +
|
| rdf:type |
http://dbpedia.org/ontology/Plant +
|
| rdfs:comment |
In the mathematical subfield of graph theo … 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.n this case, the two centers are adjacent.
|
| rdfs:label |
Centered tree
|
