Wyniki wyszukiwania - BazTech

Ograniczanie wyników

4 Zeszyty Naukowe Politechniki Rzeszowskiej. Matematyka

Znaleziono wyników: 4

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: stable sets

Sortuj według:

Ogranicz wyniki do:

The total number of stable sets in some classes of trees

Startek M., Włoch I.

Zeszyty Naukowe Politechniki Rzeszowskiej. Matematyka

2000

z. 24 [181]

131-135

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.

The number of all stable sets in r-ary tree

Bród D., Włoch A.

Zeszyty Naukowe Politechniki Rzeszowskiej. Matematyka

2000

z. 24 [181]

21-26

The total number of all stable sets of graph Pn is represented by Fibonacci numbers Fn, see [2]. 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[2] and [5].

On the number of all stable sets in special kinds of trees

Startek M., Włoch I.

Zeszyty Naukowe Politechniki Rzeszowskiej. Matematyka

2000

z. 24 [181]

125-130

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], [6] 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.

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.