Tytuł artykułu
Autorzy
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
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.
Rocznik
Tom
Strony
125--130
Opis fizyczny
Bibliogr. 6 poz.
Twórcy
Bibliografia
- [1] C. Berge, Principles of combinatorics, Academic Press New York and London 1971.
- [2] F. Harary, Graph Theory, Addison - Wesley, Reading, Mass. 1969.
- [3] H. Prodinger, R. F. Tichy, Fibonacci numbers of graphs, The Fibonacci Quarterly 20, No 1(1982), 16-21.
- [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. Wioch, 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 maximal independent sets in a tree, SIAM J. Alg. Discrete Math. Vol 7, No 1, January (1986), 125-130.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-PWA3-0043-0015