Sharp Bounds on the Diameter of a Graph
AbstractLet 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 ms(n) it is shown thatThe bounds on Dn.m, are sharp.
1995 ◽
Vol 118
(2)
◽
pp. 191-206
◽
Keyword(s):
1987 ◽
Vol 101
(1)
◽
pp. 7-20
◽
2018 ◽
Vol 106
(2)
◽
pp. 274-286
◽
Keyword(s):
1969 ◽
Vol 27
◽
pp. 160-161
1983 ◽
Vol 41
◽
pp. 708-709
1974 ◽
Vol 32
◽
pp. 436-437
1978 ◽
Vol 36
(1)
◽
pp. 548-549
◽
1978 ◽
Vol 36
(1)
◽
pp. 540-541
1978 ◽
Vol 36
(1)
◽
pp. 456-457
1988 ◽
Vol 46
◽
pp. 218-219