About: Starlike tree

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In the area of mathematics known as graph theory, a tree is said to be starlike if it has exactly one vertex of degree greater than 2. This high-degree vertex is the root and a starlike tree is obtained by attaching at least three linear graphs to this central vertex.

Property Value
dbo:abstract
  • In the area of mathematics known as graph theory, a tree is said to be starlike if it has exactly one vertex of degree greater than 2. This high-degree vertex is the root and a starlike tree is obtained by attaching at least three linear graphs to this central vertex. (en)
dbo:wikiPageID
  • 53828785 (xsd:integer)
dbo:wikiPageLength
  • 1365 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1096717548 (xsd:integer)
dbo:wikiPageWikiLink
dbp:id
  • SpiderGraph (en)
dbp:title
  • Spider Graph (en)
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • In the area of mathematics known as graph theory, a tree is said to be starlike if it has exactly one vertex of degree greater than 2. This high-degree vertex is the root and a starlike tree is obtained by attaching at least three linear graphs to this central vertex. (en)
rdfs:label
  • Starlike tree (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License