Abstract
The main result of this paper is an upper bound on the number of independent sets in a tree in terms of the order and diameter of the tree. This new upper bound is a refinement of the bound given by Prodinger and Tichy [ Fibonacci Q., 20 (1982), no. 1, 16-21]. Finally, we give a sufficient condition for the new upper bound to be better thatn the upper bound given by Brigham, Chandrasekharan and Dutton [ Fibonacci Q., 31 (1993), no. 2, 98-104].
| Original language | English |
|---|---|
| Journal | Ars Combinatoria |
| Volume | 84 |
| Pages (from-to) | 85-96 |
| Number of pages | 12 |
| ISSN | 0381-7032 |
| Publication status | Published - 2007 |
Fingerprint
Dive into the research topics of 'An upper bound on the number of independent sets in a tree'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver