Bounds for the distance spectral radius of split graphs

A graph [Formula: see text] is a split graph, if its vertex set can be partitioned into an independent set and a clique. In this paper, we obtain sharp bounds for the distance spectral radius of split graphs. It is known that the diameter of a split graph is at most [Formula: see text]. We find the distance spectral radius of all biregular split graphs of diameter [Formula: see text] and some biregular split graphs of diameter [Formula: see text].