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

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

Słowa kluczowe

EN

undirected graph; Fibonacci numbers; stable sets

PL

graf nieskierowany; liczby Fibonacciego; zbiory stabilne

• Wydawca: Oficyna Wydawnicza Politechniki Rzeszowskiej
• Czasopismo: Zeszyty Naukowe Politechniki Rzeszowskiej. Matematyka
• Rocznik: 2000
• Tom: z. 24 [181]
• Strony: 125--130
• Opis fizyczny: Bibliogr. 6 poz.

Twórcy

autor

Startek M.

autor

Włoch I.

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