  For any finite, undirected, non-bipartite, vertex-transitive graph, we
establish an explicit lower bound for the smallest eigenvalue of its normalised
adjacency operator, which depends on the graph only through its degree and its
isoperimetric constant.
