<p>A book is a connected graph on at least three vertices, which has a unique edge <i>e</i> such that the intersection of any two induced cycles is exactly the edge <i>e</i> and its vertices. We determine the unique graphs with maximum and minimum distance spectral radius among books with fixed numbers of vertices and induced cycles, respectively, the unique graphs with maximum distance spectral radius among books with fixed numbers of vertices, and the unique graphs with minimum distance spectral radius among books with fixed numbers of vertices and pendant vertices.</p>