Skip to main navigation Skip to search Skip to main content

An upper bound on the number of independent sets in a tree

  • Preben D. Vestergaard
  • , Anders Sune Pedersen

Research output: Contribution to journal › Journal article › Research › peer-review

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 languageEnglish
JournalArs Combinatoria
Volume84
Pages (from-to)85-96
Number of pages12
ISSN0381-7032
Publication statusPublished - 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