Geodesic
Minimal trees with a given vertex-search number
Diskretnaya Matematika, Tome 4 (1992) no. 2, pp. 52-60 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

Minimal trees with given vertex-search number (an invariant of graphs which arises in case of consideration of a search problem on a graph) are considered. Families of all such trees for a given vertex-search number have been constructed, and the problem of enumeration of the minimal trees has been solved, as well. 
@article{DM_1992_4_2_a5,
     author = {P. A. Golovach},
     title = {Minimal trees with a~given vertex-search number},
     journal = {Diskretnaya Matematika},
     pages = {52--60},
     year = {1992},
     volume = {4},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1992_4_2_a5/}
}
TY  - JOUR
AU  - P. A. Golovach
TI  - Minimal trees with a given vertex-search number
JO  - Diskretnaya Matematika
PY  - 1992
SP  - 52
EP  - 60
VL  - 4
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/DM_1992_4_2_a5/
LA  - ru
ID  - DM_1992_4_2_a5
ER  - 
%0 Journal Article
%A P. A. Golovach
%T Minimal trees with a given vertex-search number
%J Diskretnaya Matematika
%D 1992
%P 52-60
%V 4
%N 2
%U http://geodesic.mathdoc.fr/item/DM_1992_4_2_a5/
%G ru
%F DM_1992_4_2_a5
P. A. Golovach. Minimal trees with a given vertex-search number. Diskretnaya Matematika, Tome 4 (1992) no. 2, pp. 52-60. http://geodesic.mathdoc.fr/item/DM_1992_4_2_a5/