The least eigenvalue of a graph with a given domination number

In this paper, we characterize the unique graph whose least eigenvalue achieves the minimum among all graphs with n vertices and domination number γ. Thus we can obtain a lower bound on the least eigenvalue of a graph in terms of the domination number.