In mathematics and computer science, an unrooted binary tree is an unrooted tree in which each vertex has either one or three neighbors. == Definitions == A free tree or unrooted tree is a connected undirected graph with no cycles.
In mathematics and computer science, an unrooted binary tree is an unrooted tree in which each vertex has either one or three neighbors. == Definitions == A free tree or unrooted tree is a connected undirected graph with no cycles.
Source: Wikipedia "Unrooted binary tree" · CC BY-SA 4.0
Share this article: X · Bluesky