Minimal trees of a given search number

We consider families of all minimal trees of a given search number, which is an invariant in problems of searching in a graph. The problem of enumeration of these families is solved.Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 25–31, July–August, 1992.