Accession Number:

ADA261848

Title:

On Constructing Some Strongly Well-Covered Graphs

Descriptive Note:

Corporate Author:

BELMONT UNIV NASHVILLE TN DEPT OF MATHEMATICS

Personal Author(s):

Report Date:

1991-01-01

Pagination or Media Count:

16.0

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.

Subject Categories:

  • Numerical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE