  In this paper, we determine the graphs whose spectral radius and distance
spectral radius attain maximum and minimum among all complements of clique
trees. Furthermore, we also determine the graphs whose spectral radius and
distance spectral radius attain minimum and maximum among all complements of
block graphs, respectively.
