RUS  ENG
Full version
JOURNALS // Diskretnyi Analiz i Issledovanie Operatsii // Archive
Diskretn. Anal. Issled. Oper., 2015 Volume 22, Issue 1, Pages 19–31 (Mi da804)
This article is cited in 3 papers

On an extremal inverse problem in graph theory

A. B. Dainiak, A. D. Kurnosov

Moscow Institute of Physics and Technology, 9 Institutskii per., 141700 Dolgoprudnyi, Russia

Abstract: Upper bounds are obtained for minimal number of vertices in graphs having prescribed number of maximal independent sets. Ill. 1, bibliogr. 6.

Keywords: inverse problem, independent set, bipartite graph.

UDC: 519.176

Received: 11.03.2014
Revised: 12.09.2014

DOI: 10.17377/daio.2015.22.445


 English version: Journal of Applied and Industrial Mathematics, 2015, 9:2, 157–164

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024