On the spectral radius of graphs with a given domination number

We characterize the graphs which achieve the maximum value of the spectral radius of the adjacency matrix in the sets of all graphs with a given domination number and graphs with no isolated vertices and a given domination number.