Geodesic
Trees of Diameter $6$ and $7$ with Minimum Number of Independent Sets
Matematičeskie zametki, Tome 109 (2021) no. 2, pp. 276-289

Voir la notice de l'article provenant de la source Math-Net.Ru

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$.
Keywords: independent set, tree, diameter. 
@article{MZM_2021_109_2_a10,
     author = {D. S. Taletskii},
     title = {Trees of {Diameter} $6$ and $7$ with {Minimum} {Number} of {Independent} {Sets}},
     journal = {Matemati\v{c}eskie zametki},
     pages = {276--289},
     publisher = {mathdoc},
     volume = {109},
     number = {2},
     year = {2021},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_2021_109_2_a10/}
}
TY  - JOUR
AU  - D. S. Taletskii
TI  - Trees of Diameter $6$ and $7$ with Minimum Number of Independent Sets
JO  - Matematičeskie zametki
PY  - 2021
SP  - 276
EP  - 289
VL  - 109
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_2021_109_2_a10/
LA  - ru
ID  - MZM_2021_109_2_a10
ER  - 
%0 Journal Article
%A D. S. Taletskii
%T Trees of Diameter $6$ and $7$ with Minimum Number of Independent Sets
%J Matematičeskie zametki
%D 2021
%P 276-289
%V 109
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_2021_109_2_a10/
%G ru
%F MZM_2021_109_2_a10
D. S. Taletskii. Trees of Diameter $6$ and $7$ with Minimum Number of Independent Sets. Matematičeskie zametki, Tome 109 (2021) no. 2, pp. 276-289. http://geodesic.mathdoc.fr/item/MZM_2021_109_2_a10/