|
This article is cited in 3 scientific papers (total 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.
Received: 11.03.2014 Revised: 12.09.2014
Citation:
A. B. Dainiak, A. D. Kurnosov, “On an extremal inverse problem in graph theory”, Diskretn. Anal. Issled. Oper., 22:1 (2015), 19–31; J. Appl. Industr. Math., 9:2 (2015), 157–164
Linking options:
https://www.mathnet.ru/eng/da804 https://www.mathnet.ru/eng/da/v22/i1/p19
|
Statistics & downloads: |
Abstract page: | 295 | Full-text PDF : | 108 | References: | 30 | First page: | 16 |
|