par Bruyère, Véronique;Joret, Gwenaël 
;Melot, Hadrien
Référence Graphs and combinatorics, 28, 2, page (167-187)
Publication Publié, 2012-03
;Melot, Hadrien Référence Graphs and combinatorics, 28, 2, page (167-187)
Publication Publié, 2012-03
Article révisé par les pairs
| Résumé : | We study the structure of trees minimizing their number of stable sets for given order n and stability number α. Our main result is that the edges of a non-trivial extremal tree can be partitioned into n - α stars, each of size [n-1/n-α] or [n-1/n-α], so that every vertex is included in at most two distinct stars, and the centers of these stars form a stable set of the tree. © 2011 Springer. |
