In  it was presented a graph representation of the Fibonacci numbers Fn. It is interesting to know that Fn is the total number of all stable sets of undirected graph Pn. In ,  it was estimated the number of all stable sets in trees on n vertices. Our aim is to determine the number of all stable sets in special kinds of trees. These results are given by the second-order linear recurrence relations which generalized the Fibonacci number.
Bibliogr. 5 poz.