On Constructing Some Strongly Well-Covered Graphs
BELMONT UNIV NASHVILLE TN DEPT OF MATHEMATICS
Pagination or Media Count:
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.
- Numerical Mathematics