arXiv Analytics

Sign in

arXiv:0812.4948 [math.CO]AbstractReferencesReviewsResources

Sharp bounds for the number of maximal independent sets in trees of fixed diameter

Alexander Dainiak

Published 2008-12-29Version 1

We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are described up to isomorphism.

Comments: 12 pages, 9 figures
Categories: math.CO
Subjects: 05C05, 05C35
Related articles: Most relevant | Search more
arXiv:math/0207100 [math.CO] (Published 2002-07-11, updated 2005-04-30)
Maximal Independent Sets In Graphs With At Most r Cycles
arXiv:1111.4442 [math.CO] (Published 2011-11-18)
Inverse problems for the number of maximal independent sets
arXiv:2409.06081 [math.CO] (Published 2024-09-09)
Sharp Bounds for Generalized Zagreb Indices of Graphs

Links

Toolbox