  For a connected graph $G$, the distance Laplacian spectral radius of $G$ is
the spectral radius of its distance Laplacian matrix $\mathcal{L}(G)$ defined
as $\mathcal{L}(G)=Tr(G)-D(G)$, where $Tr(G)$ is a diagonal matrix of vertex
transmissions of $G$ and $D(G)$ is the distance matrix of $G$. In this paper,
we determine the unique graphs with maximum distance Laplacian spectral radius
among unicyclic graphs.
