Merrifield-Simmons index and minimum number of independent sets in shor trees

Allan Frendrup, Anders Sune Pedersen, Alexander A. Sapozhenko, Preben D. Vestergaard

Research output: Book/ReportReportResearch

357 Downloads (Pure)

Abstract

In Ars Comb. 84 (2007), 85-96, Pedersen and Vestergaard posed the problem of determining a lower bound for the number of independent sets in a tree of fixed order and diameter d. Asymptotically, we give here a complete solution for trees of diameter d ≤ 5. The lower bound is 5 n/3 and we give the structure of the extremal trees. A generalization to connected graphs is stated.
Original languageEnglish
Place of PublicationAalborg
PublisherDepartment of Mathematical Sciences, Aalborg University
Number of pages13
Publication statusPublished - 2009
SeriesResearch Report Series
NumberR-2009-03
ISSN1399-2503

Fingerprint

Dive into the research topics of 'Merrifield-Simmons index and minimum number of independent sets in shor trees'. Together they form a unique fingerprint.

Cite this