Ograniczanie wyników
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie   Strona / 1   Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  zbiory stabilne Sortuj według: Ogranicz wyniki do:   Strona / 1   EN
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.
EN
The total number of all stable sets of graph Pn is represented by Fibonacci numbers Fn, see . In this paper we calculate the number of all stable sets in special kinds of trees. This number is given by recurence relations and presented results generalized theorems from and .
EN
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 bounded the number of all maximal (with respect to set inclusion) stable sets in trees on n vertices. Only for special kinds of trees the number of all stable sets can be determined. 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.
EN
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.   Strona / 1    JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.