@article{Pirzada_Khan_2023, title={On the sum of distance Laplacian eigenvalues of graphs}, volume={54}, url={https://journals.math.tku.edu.tw/index.php/TKJM/article/view/4120}, DOI={10.5556/j.tkjm.54.2023.4120}, abstractNote={<p>Let $G$ be a connected graph with $n$ vertices, $m$ edges and having diameter $d$. The distance Laplacian matrix $D^{L}$ is defined as $D^L=$Diag$(Tr)-D$, where Diag$(Tr)$ is the diagonal matrix of vertex transmissions and $D$ is the distance matrix of $G$. The distance Laplacian eigenvalues of $G$ are the eigenvalues of $D^{L}$ and are denoted by $\delta_{1}, ~\delta_{1},~\dots,\delta_{n}$. In this paper, we obtain (a) the upper bounds for the sum of $k$ largest and (b) the lower bounds for the sum of $k$ smallest non-zero, distance Laplacian eigenvalues of $G$ in terms of order $n$, diameter $d$ and Wiener index $W$ of $G$. We characterize the extremal cases of these bounds. As a consequence, we also obtain the bounds for the sum of the powers of the distance Laplacian eigenvalues of $G$.</p>}, number={1}, journal={Tamkang Journal of Mathematics}, author={Pirzada, Shariefuddin and Khan, Saleem}, year={2023}, month={Feb.}, pages={83–91} }