On Constructing Some Strongly Well-Covered Graphs
Abstract
A graph is well-covered if every maximal independent set is a maximum independent set. If a well-covered graph G has the additional property that G-e is also well-covered for every line e in G, then we say the graph is strongly well-covered. We exhibit a construction which produces strongly well-covered graphs with arbitrarily large (even) independence number. The construction is in terms of a lexicographic graph product.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1991
- Accession Number
- ADA261848
Entities
People
- Michael R. Pinter
Organizations
- Belmont University