Tree components in random distance graphs of special form

In this work, we consider the problem of distribution of the number of tree components with given number of vertices k(k ?? 2) for a certain series of random distance graphs. Generalizations of the classical Erd?s?CRényi results are obtained in the case of geometric graphs of special form.