Let Gn,Ξ³β be the set of all connected graphs on n vertices with
domination number Ξ³. A graph is called a minimizer graph if it attains
the minimum spectral radius among Gn,Ξ³β. Very recently, Liu, Li and
Xie [Linear Algebra and its Applications 673 (2023) 233--258] proved that the
minimizer graph over all graphs in Gn,Ξ³β must be a tree.
Moreover, they determined the minimizer graph among
Gn,β2nβββ for even n, and posed the conjecture on the
minimizer graph among Gn,β2nβββ for odd n. In this
paper, we disprove the conjecture and completely determine the unique minimizer
graph among Gn,β2nβββ for odd n