Controllable graphs with least eigenvalue at least -2

Abstract

Connected graphs whose eigenvalues are distinct and main are called controllable graphs in view of certain applications in control theory. We give some general characterizations of the controllable graphs whose least eigenvalue is bounded from below by -2; in particular, we determine all the controllable exceptional graphs. We also investigate the controllable graphs whose second largest eigenvalue does not exceed 1.