Trees of Diameter $6$ and $7$ with Minimum Number of Independent Sets

We consider the problem of describing $n$-vertex trees of diameter $d$ containing as few independent sets as possible. This problem is solved for $d=6$ and $n>160$, as well as for $d=7$ and $n>400$.