# terminal vertex

## terminal vertex

[′tər·mən·əl ′vər‚teks]
(mathematics)
A vertex in a rooted tree that has no successor. Also known as leaf.
Mentioned in ?
References in periodicals archive ?
G](v) = 1 then v is called a pendant vertex or a terminal vertex.
Note that, the terminal vertex need not be an active vertex.
t] be the tip and the terminal vertex of P, respectively.
Let P be the primary path of V LR(i) for some i and v be the terminal vertex of P.
Since t is the smallest such number, the terminal vertex of P is the last vertex in the V LR ordering of V LR(i) and [v.
Finally consider the definition of a terminal vertex as one with exactly one edge attached to it.
The shortest path can be easily constructed by working backward from the terminal vertex such that we go to that predecessor whose label differs exactly by the length of the connecting edge.
T] is: (a) a terminal vertex if it is the bottom or top vertex of some black tile; (b) an ordinary vertex if all tiles in [F.
1 Let v be a terminal vertex belonging to a black ij-tile [tau].
i) v is not connected by edge with another terminal vertex (whence [absolute value of [E.
T](v)] [greater than or equal to] 3 for each terminal vertex v in [G.

Site: Follow: Share:
Open / Close