on distance laplacian spectral invariants of brooms and their complements

For a connected graph $g$ of order $n$, the distance laplacian matrix $d^l(g)$ is defined as $d^l(g)=tr(g)-d(g)$, where $tr(g)$ is the diagonal matrix of vertex transmissions and $d(g)$ is the distance matrix of $g$. the largest eigenvalue of $d^l(g)$ is the distance laplacian spectral radius of $g$ and the quantity $dle(g)=sumlimits_{i=1}^{n}|rho^l_i(g)-frac{2w(g)}{n}|$, where $w(g)$ is the wiener index of $g$, is the distance laplacian energy of $g$. brooms of diameter $4$ are the trees obtained from the path $p_{5}$ by appending pendent vertices at some vertex of $ p_{5}$. one of the interesting and important problems in spectral graph theory is to find extremal graphs for a spectral graph invariant and ordering them according to this graph invariant. this problem has been considered for many families of graphs with respect to different graph matrices. in the present article, we consider this problem for brooms of diameter $4$ and their complements with respect to their distance laplacian matrix. formally, we discuss the distance laplacian spectrum and the distance laplacian energy of brooms of diameter $4$. we will prove that these families of trees can be ordered in terms of their distance laplacian energy and the distance laplacian spectral radius. further, we obtain the distance laplacian spectrum and the distance laplacian energy of complement of the family of double brooms and order them in terms of the smallest non-zero distance laplacian eigenvalue and the distance laplacian energy.