A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets
type: Item
instance of: scholarly article
title: A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets
zbMATH Open document ID: 0796.05079
DOI: 10.1016/0012-365X(94)90156-2
author: Bert L. Hartnell
author: Carol A. Whitehead
author: Arthur S. Finbow
published in: Discrete Mathematics
publication date: 1994-06-09T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 562659
zbMATH Keywords: well-covered graph
zbMATH Keywords: maximal independent set
zbMATH Keywords: girth
MaRDI profile type: Publication
cites work: Q3919752
cites work: Q4711490
cites work: Very well covered graphs
cites work: Q3211344
cites work: Q5184700
cites work: A characterization of well covered graphs of girth 5 or greater
cites work: A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
cites work: Some covering concepts in graphs
cites work: Q4179024
cites work: On some subclasses of well-covered graphs
description: scientific article; zbMATH DE number 562659