Starlike tree
id:
starlike-tree-297-1286489
title:
Starlike tree
text:
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.
brand slug:
wiki
category slug:
encyclopedia
description:
Tree graph with exactly one vertex of degree >2
original url:
https://en.wikipedia.org/wiki/Starlike_tree
date created:
date modified:
2023-10-27T16:51:06Z
main entity:
{"identifier":"Q30672836","url":"https://www.wikidata.org/entity/Q30672836"}
image:
fields total:
13
integrity:
14