Article contents
Sharp Bounds on the Diameter of a Graph
Published online by Cambridge University Press: 20 November 2018
Abstract
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 ms(n) it is shown that
The bounds on Dn.m, are sharp.
Keywords
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 01
References
- 2
- Cited by