Accession Number : ADA261848


Title :   On Constructing Some Strongly Well-Covered Graphs


Corporate Author : BELMONT UNIV NASHVILLE TN DEPT OF MATHEMATICS


Personal Author(s) : Pinter, Michael R


Full Text : https://apps.dtic.mil/dtic/tr/fulltext/u2/a261848.pdf


Report Date : Jan 1991


Pagination or Media Count : 16


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.


Descriptors :   *GRAPHS , CONSTRUCTION , POINTS(MATHEMATICS)


Subject Categories : Numerical Mathematics


Distribution Statement : APPROVED FOR PUBLIC RELEASE