On the spectral radius of graphs with a given domination number (Q2479498)

The graphs with given number \(n\) of vertices, given domination number \(\gamma\) and maximum spectral radius \(\rho\) are characterized. The general bound \(\rho\leq n-\gamma\) is attained by unique (up to isomorphism) graphs, which contain in case of \(\gamma\geq 3\) isolated vertices. Restricting on graphs without isolated vertices the extremal graphs are also unique. In case of \(\gamma\geq 3\) the extremal graph is a surjectiye split graph consisting of a clique \(K_{n-\gamma}\) and a stable set \(S\) of \(\gamma\) vertices, one of them being adjacent to \(n- 2\gamma+ 1\) vertices of the clique, while each other vertex of \(S\) is adjacent to one vertex of the clique, and such that each vertex of the clique has precisely one neighbour in \(S\).