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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
V. E. Alekseev, “Upper Bound of the Number of Maximal Independent Sets of a Graph,” Diskret. Mat. 19(3), 84–88 (2007).
A. A. Sapozhenko, “On the Number of Independent Sets in Graphs,” Vestn. Mosk. Univ., Ser. 1: Mat., Mekh., No. 3, pp. 33–37 (2007).
C. Croitoru, “On Stables in Graphs,” in Proc. Third Coll. Operations Research, Cluj-Napoca, Romania, 1979 (Babes-Bolyai Univ., Cluj-Napoca, 1979), pp. 55–60.
A. S. Pedersen and P. D. Vestergaard, “Bounds on the Number of Vertex Independent Sets in a Graph,” Taiwan. J. Math. 10, 1575–1587 (2006).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A.B. Dainyak, 2009, published in Vestnik Moskovskogo Universiteta. Vychislitel’naya Matematika i Kibernetika, 2009, No. 2, pp. 41–44.
About this article
Cite this article
Dainyak, A.B. Estimates of the number of independent sets in graphs with a fixed independence number. MoscowUniv.Comput.Math.Cybern. 33, 97–100 (2009). https://doi.org/10.3103/S027864190902006X
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S027864190902006X