Moussi, Rania (Halifax, N.S. : Saint Mary's University, 2012)
A graph G is said to be well-covered if every maximal independent set
is a maximum independent set. The concept of well-coveredness is of interest due
to the fact that determining the independence number of an arbitrary ...