Geodesic
On ( k,l )-radius of random graphs
Acta mathematica Universitatis Comenianae, Tome 75 (2006) no. 2 
M. Horvathova. On ( k,l )-radius of random graphs. Acta mathematica Universitatis Comenianae, Tome 75 (2006) no. 2. http://geodesic.mathdoc.fr/item/AMUC_2006_75_2_a0/
@article{AMUC_2006_75_2_a0,
     author = {M. Horvathova},
     title = {On ( k,l )-radius of random graphs},
     journal = {Acta mathematica Universitatis Comenianae},
     year = {2006},
     volume = {75},
     number = {2},
     url = {http://geodesic.mathdoc.fr/item/AMUC_2006_75_2_a0/}
}
TY  - JOUR
AU  - M. Horvathova
TI  - On ( k,l )-radius of random graphs
JO  - Acta mathematica Universitatis Comenianae
PY  - 2006
VL  - 75
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/AMUC_2006_75_2_a0/
ID  - AMUC_2006_75_2_a0
ER  - 
%0 Journal Article
%A M. Horvathova
%T On ( k,l )-radius of random graphs
%J Acta mathematica Universitatis Comenianae
%D 2006
%V 75
%N 2
%U http://geodesic.mathdoc.fr/item/AMUC_2006_75_2_a0/
%F AMUC_2006_75_2_a0

Voir la notice de l'article provenant de la source Comenius University

We introduce the concept of ( k, l )-radius of a graph and prove that for any fixed pair k, l the ( k, l )-radius is equal to $2{k\choose 2}-{l\choose2}$ for almost all graphs. Since for k = 2 and l = 0 the ( k, l )-radius is equal to the diameter, our result is a generalization of the known fact that almost all graphs have diameter two.