|
This article is cited in 2 scientific papers (total in 2 papers)
Trees of Diameter $6$ and $7$ with Minimum Number of Independent Sets
D. S. Taletskii National Research University "Higher School of Economics", Nizhny Novgorod Branch
Abstract:
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.
Received: 10.04.2020 Revised: 30.07.2020
Citation:
D. S. Taletskii, “Trees of Diameter $6$ and $7$ with Minimum Number of Independent Sets”, Mat. Zametki, 109:2 (2021), 276–289; Math. Notes, 109:2 (2021), 280–291
Linking options:
https://www.mathnet.ru/eng/mzm12749https://doi.org/10.4213/mzm12749 https://www.mathnet.ru/eng/mzm/v109/i2/p276
|
Statistics & downloads: |
Abstract page: | 252 | Full-text PDF : | 94 | References: | 51 | First page: | 11 |
|