Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: undirect graph

Sortuj według:

Ogranicz wyniki do:

The number of all stable sets in some classes of graphs

Startek M., Włoch I.

Zeszyty Naukowe Politechniki Rzeszowskiej. Matematyka

1999

z. 23 [175]

117-121

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.