Chung, F. R. K.; Faber, V.; Manteuffel, Thomas A. An upper bound on the diameter of a graph from eigenvalues associated with its Laplacian. (English) Zbl 0808.05072 SIAM J. Discrete Math. 7, No. 3, 443-457 (1994). An upper bound for the diameter of a graph, which depends on the largest and on the second smallest eigenvalues of the graph Laplacian, is derived. Reviewer: D.Cvetković (Beograd) Cited in 2 ReviewsCited in 26 Documents MSC: 05C50 Graphs and linear algebra (matrices, eigenvalues, etc.) 05C35 Extremal problems in graph theory Keywords:upper bound; diameter; eigenvalues; Laplacian PDFBibTeX XMLCite \textit{F. R. K. Chung} et al., SIAM J. Discrete Math. 7, No. 3, 443--457 (1994; Zbl 0808.05072) Full Text: DOI