Distance (signless) Laplacian spectral radius of uniform hypergraphs.

We determine the unique hypergraphs with minimum distance Laplacian spectral radius among connected k -uniform hypergraphs and k -uniform hypertrees, respectively. We also determine the unique hypergraphs with minimum distance signless Laplacian spectral radius among connected k -uniform hypergraphs, k -uniform hypertrees, and connected k -uniform hypergraphs with given number of pendant edges, respectively. We propose a graft transformation for uniform hypergraphs that increases the distance Laplacian (distance signless Laplacian, respectively) spectral radius, and as applications, we determine the unique power hypertrees with maximum distance Laplacian (distance signless Laplacian, respectively) spectral radius. [ABSTRACT FROM AUTHOR]