|
Trees with a given number of leaves and the maximal number of maximum independent sets
D. S. Taletskiia, D. S. Malyshevb a Lobachevski State University of Nizhni Novgorod
b State University – Higher School of Economics, Nizhny Novgorod Branch
Abstract:
A complete description of trees with maximal possible number of maximum independent sets among all $n$-vertex trees with exactly $l$ leaves is obtained. For all values of the parameters $n$ and $l$ the extremal tree is unique and is the result of merging the endpoints of $l$ simple paths.
Keywords:
independent set, maximum independent set, maximal independent set, extremal tree.
Received: 06.12.2018 Revised: 14.05.2020
Citation:
D. S. Taletskii, D. S. Malyshev, “Trees with a given number of leaves and the maximal number of maximum independent sets”, Diskr. Mat., 32:2 (2020), 71–84; Discrete Math. Appl., 31:2 (2021), 135–144
Linking options:
https://www.mathnet.ru/eng/dm1554https://doi.org/10.4213/dm1554 https://www.mathnet.ru/eng/dm/v32/i2/p71
|
| Statistics & downloads: |
| Abstract page: | 838 | | Full-text PDF : | 256 | | References: | 81 | | First page: | 21 |
|