Abstract
A maximal independent set is an independent set that is not a proper subset of any other independent set. In this paper, we determine the third largest number of maximal independent sets among all graphs of order \(n\geqslant 3\) and identify the corresponding extremal graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Bulletin of the Malaysian Mathematical Sciences Society
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.