A graph representation of the Fibonacci numbers Fn it was given in . They proved that Fn is the number of all stable sets of undirected graph Pn. In ,  authors bounded the number of all maximal stable sets in trees on n vertices. In this paper we determine the number of all stable sets in some kinds of trees. These results are given by the linear recurrence relations containing generalized Fibonacci number.