A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets
A graph \(G\) is called a well-covered graph if every maximal independent set of \(G\) is a maximum. This article considers graphs in which there are exactly two sizes of maximal independent sets. A characterization of such graphs is obtained for graphs of girth eight or more.
scientific article; zbMATH DE number 562659