Sharp Bounds on the Diameter of a Graph Journal Articles

abstract

• 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.

authors

• Smyth, William

status

• published 

publication date

• March 1, 1987

has subject area

• 0101 Pure Mathematics (FoR)
• General Mathematics (Science Metrix)

published in

• Canadian Mathematical Bulletin  Journal

keywords

• Mathematics
• Physical Sciences
• Science & Technology

Digital Object Identifier (DOI)

• 10.4153/cmb-1987-010-0

start page

• 72

end page

• 74

volume

• 30

issue

• 1