Geodesic
Diameters of random distance graphs
Contemporary Mathematics and Its Applications, Tome 100 (2016), pp. 24-35 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

This paper contains an almost exhaustive description of all cases where a distance random graph asymptotically almost surely has diameter 1, 2, or greater than 2. 
@article{CMA_2016_100_a3,
     author = {L. Iskhakov and M. Mironov},
     title = {Diameters of random distance graphs},
     journal = {Contemporary Mathematics and Its Applications},
     pages = {24--35},
     year = {2016},
     volume = {100},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/CMA_2016_100_a3/}
}
TY  - JOUR
AU  - L. Iskhakov
AU  - M. Mironov
TI  - Diameters of random distance graphs
JO  - Contemporary Mathematics and Its Applications
PY  - 2016
SP  - 24
EP  - 35
VL  - 100
UR  - http://geodesic.mathdoc.fr/item/CMA_2016_100_a3/
LA  - ru
ID  - CMA_2016_100_a3
ER  - 
%0 Journal Article
%A L. Iskhakov
%A M. Mironov
%T Diameters of random distance graphs
%J Contemporary Mathematics and Its Applications
%D 2016
%P 24-35
%V 100
%U http://geodesic.mathdoc.fr/item/CMA_2016_100_a3/
%G ru
%F CMA_2016_100_a3
L. Iskhakov; M. Mironov. Diameters of random distance graphs. Contemporary Mathematics and Its Applications, Tome 100 (2016), pp. 24-35. http://geodesic.mathdoc.fr/item/CMA_2016_100_a3/