Tytuł artykułu
Autorzy
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
A graph representation of the Fibonacci numbers Fn it was given in [3]. They proved that Fn is the number of all stable sets of undirected graph Pn. In [4], [5] 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.
Rocznik
Tom
Strony
131--135
Opis fizyczny
Bibliogr. 5 poz.
Twórcy
Bibliografia
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-PWA3-0043-0016