Tytuł artykułu
Autorzy
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
In [3] 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 [4], [5] 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.
Rocznik
Tom
Strony
117--121
Opis fizyczny
Bibliogr. 5 poz.
Twórcy
Bibliografia
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-PWA3-0042-0027