Maximal Independent Sets In Graphs With At Most r Cycles
arXiv:math/0207100
Abstract
We find the maximum number of maximal independent sets in two families of graphs: all graphs with vertices and at most cycles, and all such graphs that are also connected. In addition, we characterize the extremal graphs.
31 pages, 11 figures, Latex, see related papers at http://www.math.msu.edu/~sagan, split paper into two parts