NEW BOUNDS AND EXTREMAL GRAPHS FOR DISTANCE SIGNLESS LAPLACIAN SPECTRAL RADIUS

Message:
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:

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.

Language:
English
Published:
Journal of Algebraic Systems, Volume:8 Issue: 2, Winter Spring 2021
Pages:
231 to 250
https://magiran.com/p2211879