%0 Journal Article %T NEW BOUNDS AND EXTREMAL GRAPHS FOR DISTANCE SIGNLESS LAPLACIAN SPECTRAL RADIUS %J Journal of Algebraic Systems %I Shahrood University of Technology %Z 2345-5128 %A Alhevaz, A. %A Baghipur, M. %A Paul, S. %D 2021 %\ 01/01/2021 %V 8 %N 2 %P 231-250 %! NEW BOUNDS AND EXTREMAL GRAPHS FOR DISTANCE SIGNLESS LAPLACIAN SPECTRAL RADIUS %K ‎Distance signless Laplacian matrix %K spectral radius %K extremal graph %K transmission regular graph %R 10.22044/jas.2020.9540.1469 %X The distance signless Laplacian spectral radius of a connected graph $G$ is the largest eigenvalue of the distance signless Laplacian matrix of $G$, defined as $D^{Q}(G)=Tr(G)+D(G)$, where $D(G)$ is the distance matrix of $G$ and $Tr(G)$ is the diagonal matrix of vertex transmissions of $G$. In this paper, we determine some new upper and lower bounds on the distance signless Laplacian spectral radius of $G$ and characterize the extremal graphs attaining these bounds. %U https://jas.shahroodut.ac.ir/article_1954_3d76b11a1deafa958368655d5c44160b.pdf