root vertex

root vertex

[′rüt ′vər‚teks]
(mathematics)
The vertex of a rooted tree that has no predecessor.
Mentioned in ?
References in periodicals archive ?
As a consequence of Lemma 19, note that the root edge of every D gadget in any AB-graph G remains bad, that is, no matter whether other edges are incident to the root vertex r in G.
For generalization we introduce the following notations for a tree T with root vertex [v.
Then there exists a unique path from the root vertex [v.
Since each vertex (respectively, arc) in G can be attributed to one vertex (respectively, arc) in exactly one augmented graph, and there is one extra root vertex for each augmented graph, Expression (1) -- O(n + m).
In a tree with diameter D, no vertex is more than D/2 hops or edges from the root vertex of the tree [17].
1 allow us to characterize the behavior on tree-like subgraphs by making the root vertex a motor.
The root vertex has six children, which are each themselves the root vertex of subtrees, or subsidiaries, of the rake tree.
A rooted map is a map in which an angular sector incident to a vertex is distinguished, and the latter is called the root vertex.
The root vertex is the vertex incident to the root.
i) the root vertex of the cactus tree is of color 1,
a bicolored identified ordered seed tree with a white root vertex,
The reverse black levels traversal is defined similarly except that the rightmost black descendant of the white root vertex is the last vertex to be traversed.