Among bicyclic graphs (connected graphs with two independent cycles) we find those graphs whose largest eigenvalue (index, for short) is minimal.