Abstract
For any n and l, we completely describe trees with the maximum and minimum numbers of maximal independent sets among all n-vertex trees with l leaves.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
