Bounds on the distance signless Laplacian spectral radius in terms of clique number

摘要

The distance signless Laplacian spectral radius of a connected graph , denoted by , is the maximal eigenvalue of the distance signless Laplacian matrix of . In this paper, we find a sharp lower bound as well as a sharp upper bound of in terms of the clique number. Furthermore, both extremal graphs are uniquely determined.