Atlas home || Conferences | Abstracts | about Atlas

21st Cumberland Conference on Graph Theory, Combinatorics, and Computing ---In Honor of Mike Plummer's 70th Birthday
May 15-17, 2008
Vanderbilt University
Nashville, TN, USA

Organizers
Mark Ellingham and Gexin Yu

View Abstracts
Conference Homepage

Well-covered: a competitive viewpoint
by
Peter J. Slater
University of Alabama in Huntsville

The independence number b(G) and the lower independence number i(G) are the largest and smallest orders of maximal independent sets in G. Mike Plummer defined a graph to be well-covered if i(G)=b(G) (or, equivalently, if the covering and upper covering numbers are equal).

Here the interest is in competitive independent, enclaveless, packing, ... parameters that arise when two players alternately select members in a set S, one player trying to maximize the resulting order of S while the other tries to minimize |S|.

Date received: April 17, 2008

Copyright © 2008 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cawn-43.