Abstract
Abstract : A graph is well-covered if every maximal independent set is also a maximum independent set. A 1-well-covered graph G has the additional property that G-v is also well-covered for every point v in G. Thus, the 1-well-covered graphs form a subclass of the well-covered graphs. We examine triangle-free 1- well-covered graphs. Other than C5 and K2, a 1-well-covered graph must contain a triangle or a 4-cycle. Thus, the graphs we consider have girth 4. Two constructions are given which yield infinite families of 1-well-covered graphs with girth 4. These families contain graphs with arbitrarily large independence number.
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.
