A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets (Q1322267)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets |
scientific article; zbMATH DE number 562659
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets |
scientific article; zbMATH DE number 562659 |
Statements
A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets (English)
0 references
9 June 1994
0 references
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.
0 references
well-covered graph
0 references
maximal independent set
0 references
girth
0 references
