rooted tree

rooted tree

[′rüd·əd ′trē]
(mathematics)
A directed tree graph in which one vertex has no predecessor, and each of the remaining vertices has a unique predecessor.
References in classic literature ?
Poyser was saying, "when you've once took anything into your head: there's no more moving you than the rooted tree.
The many- rooted tree above him, and even the dead manhandled wood beside, knew what he sought, as he himself did not know.
A rooted tree is one in which a special node called the root is singled out.
Unified Approach To Rooted Tree Mining: Algorithms And Applications
which are hypertrees in which vertices in every edges form a rooted tree.
Proof: Such a graph is the union of a set of s unrooted trees, a set of unicyclic graphs, and a cubic multigraph K with a rooted tree attached to each vertex of K and a sequence (possibly empty) of rooted trees attached to each edge of K.
DELTA]) (very similar to ALGO([DELTA])) which aims to eliminate all the nodes of a rooted tree, from the leaves to the root.
If you buy a rooted tree, soak the roots in water before potting the tree into moist earth or a sand mixture.
Those who bought a rooted tree can simply plant it in the garden when the festivities are finished.
Bare rooted trees are planted when the tree is dormant.
The exceptions included tap-rooted trees such as nut trees and oaks, thin-barked trees like fruit trees (and their flowering equivalents, flowering cherries and crabapples), and fleshy rooted trees like magnolias.
WHAT A PANE: But the rain has meant deep rooted trees and shrubs have put on a good growth spurt this year