×

An upper bound on the diameter of a graph from eigenvalues associated with its Laplacian. (English) Zbl 0808.05072

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.

MSC:

05C50 Graphs and linear algebra (matrices, eigenvalues, etc.)
05C35 Extremal problems in graph theory
PDFBibTeX XMLCite
Full Text: DOI