Geodesic
Trees without twin-leaves with smallest number of maximal independent sets
Diskretnaya Matematika, Tome 30 (2018) no. 4, pp. 115-133

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

For any $n$, in the set of $n$-vertex trees such that any two leaves have no common adjacent vertex, we describe the trees with the smallest number of maximal independent sets.
Keywords: extremal combinatorics, tree, maximal independent set. 
@article{DM_2018_30_4_a10,
     author = {D. S. Taletskii and D. S. Malyshev},
     title = {Trees without twin-leaves with smallest number of maximal independent sets},
     journal = {Diskretnaya Matematika},
     pages = {115--133},
     publisher = {mathdoc},
     volume = {30},
     number = {4},
     year = {2018},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2018_30_4_a10/}
}
TY  - JOUR
AU  - D. S. Taletskii
AU  - D. S. Malyshev
TI  - Trees without twin-leaves with smallest number of maximal independent sets
JO  - Diskretnaya Matematika
PY  - 2018
SP  - 115
EP  - 133
VL  - 30
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2018_30_4_a10/
LA  - ru
ID  - DM_2018_30_4_a10
ER  - 
%0 Journal Article
%A D. S. Taletskii
%A D. S. Malyshev
%T Trees without twin-leaves with smallest number of maximal independent sets
%J Diskretnaya Matematika
%D 2018
%P 115-133
%V 30
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2018_30_4_a10/
%G ru
%F DM_2018_30_4_a10
D. S. Taletskii; D. S. Malyshev. Trees without twin-leaves with smallest number of maximal independent sets. Diskretnaya Matematika, Tome 30 (2018) no. 4, pp. 115-133. http://geodesic.mathdoc.fr/item/DM_2018_30_4_a10/