The second largest number of maximal independent sets in graphs with at most two cycles

@article{Jou2016TheSL,
  title={The second largest number of maximal independent sets in graphs with at most two cycles},
  author={Min-Jen Jou and Jenq-Jong Lin},
  journal={The International Journal of Contemporary Mathematical Sciences},
  year={2016},
  volume={11},
  pages={293-299}
}
Amaximal independent set is an independent set that is not a proper subset of any other independent set. Jou and Chang determined the largest number of maximal independent sets among all graphs and connected graphs of order n, which contain at most one cycle. Later B. E. Sagan and V. R. Vatter found the largest number of maximal independent sets among all graphs of order n, which contain at most r cycles. In 2012, Jou settled the second largest number of maximal independent sets in graphs with… 

References

SHOWING 1-10 OF 18 REFERENCES
The second largest number of maximal independent sets in connected graphs with at most one cycle
TLDR
This paper determines the second largest number of maximal independent sets among all graphs (respectively, connected graphs) of order n≥4 with at most one cycle.
Maximal and maximum independent sets in graphs with at most r cycles
TLDR
This paper completes the determination of c(n,r) for all n and r and characterize the extremal graphs, and solves problems for maximum independent sets.
Graphs with the second largest number of maximal independent sets
Maximal independent sets in graphs with at most r cycles
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
Maximal Independent Sets in Graphs with at Most One Cycle
The Number of Maximal Independent Sets in Triangle-Free Graphs
In this paper, it is proved that every triangle-free graph on $n \geq 4$ vertices has at most $2^{n /2} $ or $5 \cdot 2^{( n - 5 )/2} $ independent sets maximal under inclusion, whether n is even or
THE NUMBER OF MAXIMUM INDEPENDENT SETS IN GRAPHS
In this paper, we study the problem of determining the largest number of maximum independent sets of a graph of order n. Solutions to this problem are given for various classes of graphs, including
Graphs, partitions and Fibonacci numbers
On cliques in graphs
A clique is a maximal complete subgraph of a graph. The maximum number of cliques possible in a graph withn nodes is determined. Also, bounds are obtained for the number of different sizes of cliques
...
...