Abstract
Erdös and Moser raised the problem of determining the largest number of maximal independent sets of a general graph G of order n and those graphs achieving this largest number. This problem was solved by Erdös, and later Moon and Moser. It then was extensively studied for various classes of graphs, including trees, forests, (connected) graphs with at most one cycle, bipartite graphs, connected graphs, k-connected graphs and triangle-free graphs. This paper studies the problem for connected triangle-free graphs. In particular, we prove that every connected triangle, free graph of order n ⩾ 22 has at most 5 · 2 (n−6)/2 (respectively, 2 (n−1)/2) maximal independent sets if n is even (respectively, odd). Extremal graphs achieving this maximum value are also characterized.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
