Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods
The paper compares some recent bounds on the diameter and mean distance of graphs in terms of the eigenvalues of either the adjacency matrix or the Laplacian matrix of the graph.
scientific article; zbMATH DE number 1321781