The number of all stable sets in r-ary tree

• Autorzy: Bród D. , Włoch A.
• Języki publikacji: EN

Abstrakty

EN

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].

Słowa kluczowe

EN

Fibonacci numbers; stable sets

PL

liczby Fibonacciego; zbiory stabilne

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

Twórcy

autor

Bród D.

autor

Włoch A.

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

Bibliografia

• [1] C. Berge, Principles of combinatorics, Academic Press New York and London 1971.
• [2] H. Prodinger, R. F. Tichy, Fibonacci numbers of graphs, The Fibonacci Quarterly 20, No 1(1982) 16-21.
• [3] M. Kwaśnik, I. Wioch, The total number of generalized stable sets and kernels of graphs, Ars Combinatoria, 55(2000), 139-146.
• [4] B. E. Sagan, A note on independent sets in trees, SIAM J. Alg. Discrete Math. Vol. 1, No 1, February (1988) 105-108.
• [5] M. Startek, I. Włoch, The number of all stable sets in some classes of graphs, Folia Sci. Univ. Tech. Res., Vol. 175, Math. z. 23 (1999), 117-121.
• [6] H. S. Wilf, The number of maxima! independent sets in a tree, SIA, J. Alg. Discrete Math. Vol. 7, No 1, January (1986) 125-130.