Geodesic
A Note on the Diameter of a Graph
Canadian mathematical bulletin, Tome 11 (1968) no. 3, pp. 499-501

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

The distance d(x, y) between vertices x, y of a graph G is the length of the shortest path from x to y in G. The diameter δ(G) of G is the maximum distance between any pair of vertices in G. i.e. δ(G) = max max d(x, y). In this note we obtain an upper boundx ε G y ε Gfor δ(G) in terms of the numbers of vertices and edges in G. Using this bound it is then shown that for any complement-connected graph G with N vertices where is the complement of G. 
Bondy, J. A. A Note on the Diameter of a Graph. Canadian mathematical bulletin, Tome 11 (1968) no. 3, pp. 499-501. doi: 10.4153/CMB-1968-060-9
@article{10_4153_CMB_1968_060_9,
     author = {Bondy, J. A.},
     title = {A {Note} on the {Diameter} of a {Graph}},
     journal = {Canadian mathematical bulletin},
     pages = {499--501},
     year = {1968},
     volume = {11},
     number = {3},
     doi = {10.4153/CMB-1968-060-9},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1968-060-9/}
}
TY  - JOUR
AU  - Bondy, J. A.
TI  - A Note on the Diameter of a Graph
JO  - Canadian mathematical bulletin
PY  - 1968
SP  - 499
EP  - 501
VL  - 11
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1968-060-9/
DO  - 10.4153/CMB-1968-060-9
ID  - 10_4153_CMB_1968_060_9
ER  - 
%0 Journal Article
%A Bondy, J. A.
%T A Note on the Diameter of a Graph
%J Canadian mathematical bulletin
%D 1968
%P 499-501
%V 11
%N 3
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1968-060-9/
%R 10.4153/CMB-1968-060-9
%F 10_4153_CMB_1968_060_9

[1] 1. Bosák, J., Rosa, A., and Znam, Ś., On decomposition of complete graphs into factors with given diameters. Proceedings of the Colloquium on Theory of Graphs, held at Tihany, Hungary, September 1966, edited by Erdos, P. and Katona, G.. (Academic Press, New York, 1968). Google Scholar

Cité par Sources :