Geodesic
On an extremal inverse problem in graph theory
Diskretnyj analiz i issledovanie operacij, Tome 22 (2015) no. 1, pp. 19-31

Voir la notice de l'article provenant de la source Math-Net.Ru

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
Mots-clés : bipartite graph. 
@article{DA_2015_22_1_a1,
     author = {A. B. Dainiak and A. D. Kurnosov},
     title = {On an extremal inverse problem in graph theory},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {19--31},
     publisher = {mathdoc},
     volume = {22},
     number = {1},
     year = {2015},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2015_22_1_a1/}
}
TY  - JOUR
AU  - A. B. Dainiak
AU  - A. D. Kurnosov
TI  - On an extremal inverse problem in graph theory
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2015
SP  - 19
EP  - 31
VL  - 22
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2015_22_1_a1/
LA  - ru
ID  - DA_2015_22_1_a1
ER  - 
%0 Journal Article
%A A. B. Dainiak
%A A. D. Kurnosov
%T On an extremal inverse problem in graph theory
%J Diskretnyj analiz i issledovanie operacij
%D 2015
%P 19-31
%V 22
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2015_22_1_a1/
%G ru
%F DA_2015_22_1_a1
A. B. Dainiak; A. D. Kurnosov. On an extremal inverse problem in graph theory. Diskretnyj analiz i issledovanie operacij, Tome 22 (2015) no. 1, pp. 19-31. http://geodesic.mathdoc.fr/item/DA_2015_22_1_a1/