Spectral diameter estimates for \(k\)-regular graphs
An upper bound for the diameter of a regular graph, which depends on the second largest eigenvalue (in modulus) of the adjacency matrix and on the girth, is derived.
scientific article; zbMATH DE number 638535