Generation of all rooted trees up to a given height

On the Strong Secure Domination Number of a Graph

“…A tree is said to be a rooted tree [14] if one of the vertices is distinguished as the root from the remaining. In what follows, we consider a rooted tree T k , where a root vertex is of degree ℓ and all the other vertices except the support vertices are of degree k, where k ≥ ℓ.…”