Geodesic
Diameters of Random Graphs
Canadian journal of mathematics, Tome 33 (1981) no. 3, pp. 618-640

Voir la notice de l'article provenant de la source Cambridge University Press

For two nodes x and y of a graph G, the distance δG(x,y) is the smallest integer k such that k edges form a path from x to y; δG(x, x) = 0, and δG(x,y) = ∞ when x ≠ y and there is no path from x to y. The diameter δG is the maximum of δG (x, y) as x and y range over the nodes of G. When G is connected, δ(G) is the smallest integer k such that any two nodes of G can be joined by a path formed from at most k edges. When G is not connected, δ(G) = ∞ and there is interest in δc(G), the maximum of δ(G) over the components C of G.For 2 ≧ n < ∞ and 0 ≧ E ≧ n(n − l)/2, let denote the set of all loopless undirected graphs with the node-set {1, ..., n} and exactly E edges. 
Klee, Victor; Larman, David. Diameters of Random Graphs. Canadian journal of mathematics, Tome 33 (1981) no. 3, pp. 618-640. doi: 10.4153/CJM-1981-050-1
@article{10_4153_CJM_1981_050_1,
     author = {Klee, Victor and Larman, David},
     title = {Diameters of {Random} {Graphs}},
     journal = {Canadian journal of mathematics},
     pages = {618--640},
     year = {1981},
     volume = {33},
     number = {3},
     doi = {10.4153/CJM-1981-050-1},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1981-050-1/}
}
TY  - JOUR
AU  - Klee, Victor
AU  - Larman, David
TI  - Diameters of Random Graphs
JO  - Canadian journal of mathematics
PY  - 1981
SP  - 618
EP  - 640
VL  - 33
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1981-050-1/
DO  - 10.4153/CJM-1981-050-1
ID  - 10_4153_CJM_1981_050_1
ER  - 
%0 Journal Article
%A Klee, Victor
%A Larman, David
%T Diameters of Random Graphs
%J Canadian journal of mathematics
%D 1981
%P 618-640
%V 33
%N 3
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1981-050-1/
%R 10.4153/CJM-1981-050-1
%F 10_4153_CJM_1981_050_1

[1] 1. Deo, N., Breadth- and depth-first searches in graph-theoretic algorithms, Report No. TRCS-74-001 (Computer Science Centre, Indian Institute of Technology, Kanpur, 1974). Google Scholar

[2] 2. Erdôs, P., The art of counting: Selected writings (MIT Press, Cambridge, Mass., 1973). Google Scholar

[3] 3. Erdôs, P. and Rényi, A., On random graphs I, Publ. Math. (Debrecen) 6 (1959), 290–297. Google Scholar

[4] 4. Korsunov, A. D.. On the diameter of graphs, Soviet Math. Dokl. 12 (1971), 302–305. Google Scholar

[5] 5. Moon, J. and Moser, L., Almost all (0, 1) matrices are primitive, Studia Sci. Math. Hungar. 11 (1966), 153–156. Google Scholar

Cité par Sources :