Answers are grounded in this paper and cite their sources.
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 .
No takes yet. Share an insight, caveat, or question.
Ying et al. (2006) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: