Key points are not available for this paper at this time.
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 ≥ 3 r . © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 270–282, 2006
Ying et al. (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: