Maximal Independent Sets and Separating Covers
β Scribed by Vincent Vatter
- Book ID
- 115474863
- Publisher
- Mathematical Association of America
- Year
- 2011
- Tongue
- English
- Weight
- 270 KB
- Volume
- 118
- Category
- Article
- ISSN
- 0002-9890
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, we introduce a new notion of local optimality and demonstrate its application to the problem of finding optimal independent sets and vertex covers in k-claw free graphs. The maximum independent set problem in k-claw free graphs has interesting applications in the design of electronic
## Abstract A maximal independent set of a graph __G__ is an independent set that is not contained properly in any other independent set of __G.__ In this paper, we determine the maximum number of maximal independent sets among all bipartite graphs of order __n__ and the extremal graphs as well as