MAXIMAL INDEPENDENT SETS IN GRAPHS WITH AT MOST ONE CYCLE

In this paper, we determine the largest number of maximal independent sets among all connected graphs of order n, which contain at most one cycle. We also characterize those extremal graphs achieving this maxim um value. As a consequence, the corresponding results for graphs with at most one cycle but not necessarily connected are also given.