Sufficient conditions for k-leaf-connected graphs on distance (signless Laplacian) spectral radius

Let [Formula: see text] be a graph and [Formula: see text] be a subset of [Formula: see text] with [Formula: see text]. A graph [Formula: see text] is called [Formula: see text]-leaf-connected if [Formula: see text] and [Formula: see text] always has a spanning tree [Formula: see text] such that [Formula: see text] is precisely the set of leaves of [Formula: see text]. In this paper, we establish some sufficient conditions for a graph to be [Formula: see text]-leaf-connected in terms of distance spectral radius and distance signless Laplacian spectral radius. Furthermore, we also obtain some sufficient conditions on the distance (signless Laplacian) spectral radius of the complement of a graph [Formula: see text] for [Formula: see text] to be [Formula: see text]-leaf-connected.