The second largest number of maximal independent sets in connected graphs with at most one cycle

摘要

A maximal independent set is an independent set that is not a proper subset of any other independent set. In this paper, we determine the second largest number of maximal independent sets among all graphs (respectively, connected graphs) of order n≥4 with at most one cycle. We also characterize those extremal graphs achieving these values.