A characterization of the smallest eigenvalue of a graph
A characterization of the smallest eigenvalue of a graph
Abstract It is well known that the smallest eigenvalue of the adjacency matrix of a connected d ‐regular graph is at least − d and is strictly greater than − d if the graph is not bipartite. More generally, for any connected graph G = (V, E) , consider the …