Abstract
We find the maximum number of maximal independent sets in two families of graphs. The first family consists of all graphs with n vertices and at most r cycles. The second family is all graphs of the first family which are connected and satisfy n >= 3r. (C) 2006 Wiley Periodicals, Inc.
Original language | English |
---|---|
Pages (from-to) | 270-282 |
Number of pages | 13 |
Journal | Journal of Graph Theory |
Volume | 53 |
DOIs | |
Publication status | Published - Dec 2006 |
Keywords
- cycle
- ear decomposition
- maximal independent set
- NUMBER