Maximal independent sets in graphs with at most r cycles
Goh Chee Ying, Koh Khee Meng, Bruce E. Sagan, Vincent R. Vatter · Journal of Graph Theory · 2006
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. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 270–282, 2006