Diameters of Random Distance Graphs


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

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.

About the authors

L. Iskhakov

Moscow Institute of Physics and Technology (State University)

Email: Jade.Santos@springer.com
Russian Federation, Moscow

M. Mironov

Moscow Institute of Physics and Technology (State University)

Email: Jade.Santos@springer.com
Russian Federation, Moscow

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2017 Springer Science+Business Media, LLC