Protected nodes, ie, nodes with distance at least 2 to each leaf, have been studied in various
classes of random rooted trees. In this short note, we investigate the protected node profile …

The Wiener index is the sum of distances of all pairs of nodes in a graph; and the Zagreb
index is defined as the sum of squares of the degrees of nodes in a rooted tree. In this note …

Abstract The (k, r)-Quicksort on the fly is a sorting algorithm, which provides successively first
the smallest, then the second smallest and so on of a given set of seize n. Let X (n, l) be the …

An exponential recursive ternary trees (ERTTs) have the property that each node has 3
possible places (external nodes) to which a child can be attached. At each step of growing of …

An exponential recursive ternary trees (ERTTs) have the property that each node has 3
possible places (external nodes) to which a child can be attached. At each step of growing of …

For any fixed integer d≥ 2, the d-ary increasing tree is a rooted, ordered, labeled tree where
the out-degree is bounded by d, and the labels along each path beginning at the root …