The number of all stable sets in some classes of graphs

• Autorzy: Startek M. , Włoch I.
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

undirect graph; Fibonacci numbers; stable sets

PL

liczby Fibonacciego; graf nieskierowany; zbiory stabilne

• Wydawca: Oficyna Wydawnicza Politechniki Rzeszowskiej
• Czasopismo: Zeszyty Naukowe Politechniki Rzeszowskiej. Matematyka
• Rocznik: 1999
• Tom: z. 23 [175]
• Strony: 117--121
• Opis fizyczny: Bibliogr. 5 poz.

Twórcy

autor

Startek M.

autor

Włoch I.

• Department of Mathematics, Technical University of Rzeszów, Poland