In this paper, we study the problem of determining the largest number of ma
ximum independent sets of a graph of order n. Solutions to this problem are
given for various classes of graphs, including general graphs, trees, fore
sts, (connected) graphs with at most one cycle, connected graphs and triang
le-free graphs. Extremal graphs achieving the maximum values are also given
.