A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
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 is the distance matrix of G and T r(G) is the diagonal matrix of vertex transmissions of G. In this paper, we determine some upper and lower bounds on the distance signless Laplacian spectral radius of G based on its order and independence number, and characterize the extremal graphs. In addition, we give an exact description of the distancedoi:10.5614/ejgta.2018.6.2.12 fatcat:3yg27dw6wffvjjx3isugqid7la