Estimates of the number of independent sets in graphs with a fixed independence number |
| |
| Authors: | A. B. Dainyak |
| |
| Affiliation: | (1) Faculty of Computational Mathematics and Cybernetics, Moscow State University, Moscow, 119992, Russia |
| |
| Abstract: | Attainable estimates of the number of independent sets in graphs with a given size of the maximal independent set are obtained. Three graph classes—trees, forests, and the class of all graphs—are considered. Extremal graphs are described. |
| |
| Keywords: | independent set independence number |
| 本文献已被 SpringerLink 等数据库收录！ |
|
