n-ary tree

n-ary tree

[′en·ə·rē ‚trē]
(mathematics)
A rooted tree in which each vertex has at most n successors.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
References in periodicals archive ?
In order to improve the recognition efficiency, many anti-collision recognition algorithms have been proposed based on the binary tree, 4-ary tree, and n-ary tree. There are three types of time slots in the identification process of tree-based anticollision algorithms: readable time slots (one tag response), collision time slots (multiple tags response), and idle time slots (no tag response).
The total time slots of a n-ary tree anticollision algorithm and [5]
The advantage an anticollision algorithm has by using n-ary tree is that it is able to reduce collision time slots, but it increases the idle time slots.
and more generally an element of F(E)(k(n - 1) + 1) by a rooted planar n-ary tree with levels and (k(n - 1) + 1)) leaves.
[13] determined the locating chromatic number for complete n-ary trees.