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 ...

This is a preview. Log in through your library . Abstract We obtain a sharp result that for any even 𝑛 ≥ 34, every {𝐷𝑛, 𝐷𝑛+1}-regular graph of order 𝑛 contains [𝑛/4] disjoint perfect matchings, ...