Sharp Bounds on the Diameter of a Graph
Canadian mathematical bulletin, Tome 30 (1987) no. 1, pp. 72-74
Voir la notice de l'article provenant de la source Cambridge
Let Dn.m , be the diameter of a connected undirected graph on n ≥2 vertices and n - 1 ≤ m ≤ s(n) edges, where s(n) = n(n — l)/2. Then Dn.s(n) = 1, and for m s(n) it is shown that The bounds on Dn.m , are sharp.
Smyth, W. F. Sharp Bounds on the Diameter of a Graph. Canadian mathematical bulletin, Tome 30 (1987) no. 1, pp. 72-74. doi: 10.4153/CMB-1987-010-0
@article{10_4153_CMB_1987_010_0,
author = {Smyth, W. F.},
title = {Sharp {Bounds} on the {Diameter} of a {Graph}},
journal = {Canadian mathematical bulletin},
pages = {72--74},
year = {1987},
volume = {30},
number = {1},
doi = {10.4153/CMB-1987-010-0},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1987-010-0/}
}
Cité par Sources :