Strongly Well-Covered Graphs
Abstract
A graph is well-covered if every maximal independent set is a maximum independent set. A strongly well-covered graph G has the additional property that G-e is also well-covered for every line e in G. Hence, the strongly well- covered graphs are a subclass of the well- covered graphs. We characterize strongly well-covered graphs with independence number two and determine a parity condition for strongly well-covered graphs with independence number three. More generally, we show that a strongly well-covered graph (with more - than four points) is 3-connected and has minimum degree at least four.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1993
- Accession Number
- ADA262214
Entities
People
- Michael R. Pinter
Organizations
- Belmont University