Home
Scholarly Works
Sharp bounds on the diameter of a graph
Journal article

Sharp bounds on the diameter of a graph

Abstract

Abstract Let D n.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 D n.s(n) = 1, and for m s(n) it is shown that The bounds on D n.m , are sharp.

Authors

Smyth WF

Journal

Canadian Mathematical Bulletin, Vol. 30, No. 1, pp. 72–74

Publisher

Canadian Mathematical Society

Publication Date

March 1, 1987

DOI

10.4153/cmb-1987-010-0

ISSN

0008-4395

Contact the Experts team