@article {
author = {Derikvand, Tajedin and Oboudi, Mohammad Reza},
title = {On the number of maximum independent sets of graphs},
journal = {Transactions on Combinatorics},
volume = {3},
number = {1},
pages = {29-36},
year = {2014},
publisher = {University of Isfahan},
issn = {2251-8657},
eissn = {2251-8665},
doi = {10.22108/toc.2014.4060},
abstract = {Let $G$ be a simple graph. An independent set is a set of pairwise non-adjacent vertices. The number of vertices in a maximum independent set of $G$ is denoted by $\alpha(G)$. In this paper, we characterize graphs $G$ with $n$ vertices and with maximum number of maximum independent sets provided that $\alpha(G)\leq 2$ or $\alpha(G)\geq n-3$.},
keywords = {Independent set,Independence number,Maximum independent set},
url = {https://toc.ui.ac.ir/article_4060.html},
eprint = {https://toc.ui.ac.ir/article_4060_0f0b72655269c445900a6c2f92064cef.pdf}
}