  The distance spectrum of a connected graph is the spectrum of its distance
matrix. We characterize those bicyclic graphs and split graphs with the second
largest distance eigenvalue less than $-\frac{1}{2}$. Any such graph is
chordal.
