Note: An Upper Bound for the Diameter of a Graph
Russell Merris · SIAM Journal on Discrete Mathematics · 1999
In an article [SIAM J. Discrete Math., 7 (1994), pp. 443--457], Chung, Faber, and Manteuffel established an inequality for the diameter of a graph in terms of its Laplacian eigenvalues, one that could be stated more attractively if graphs with a given property did not exist. The purpose of this note is to exhibit graphs having that given property.