Abstract
In Ars Comb. 84 (2007),85-96, Pedersen and Vestergaard posed the problem of determining a lower bound for the number of independent sets in a tree of fixed order and diameter d. Asymptotically, we give here a complete solution for trees of diameter d < 5. The lower bound is 5n/3 and we give the structure of the extremal trees. A generalization to connected graphs is s tated.
Originalsprog | Engelsk |
---|---|
Tidsskrift | Ars Combinatoria |
Vol/bind | 111 |
Sider (fra-til) | 85-95 |
Antal sider | 11 |
ISSN | 0381-7032 |
Status | Udgivet - 2013 |