{'fraction_non_alphanumeric': 0.0496031746031746, 'fraction_numerical': 0.04563492063492063, 'mean_word_length': 3.9029126213592233, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An Upper Bound on the Number of Independent Sets in a Tree

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 than the upper bound given by Brigham, Chandrasekharan and Dutton [Fibonacci Q., 31 (1993), no. 2, 98–104].