Trees with a given number of leaves and the maximal number of maximum independent sets

被引：0
|
作者：
Taletskii, Dmitriy S. [1 ]
Malyshev, Dmitriy S. [2 ]
机构：
[1] Lobachevsky State Univ Nizhny Novgorod, Nizhnii Novgorod, Russia
[2] Natl Res Univ Higher Sch Econ, Moscow, Russia
来源：
DISCRETE MATHEMATICS AND APPLICATIONS | 2021年 / 31卷 / 02期
关键词：
independent set; maximum independent set; maximal independent set; extremal tree; GRAPHS; INDEX;
D O I：
10.1515/dma-2021-0012
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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.
引用
收藏
页码：135 / 144
页数：10
相关论文
共 50 条
12345