Distance signless Laplacian spectral radius and tough graphs involving minimun degree

Xiangge Liu, Yong Lu, Caili Jia +2

Let $G=(V(G),E(G))$ be a simple graph, where $V(G)$ and $E(G)$ are the vertex set and the edge set of $G$, respectively. The number of components of $G$ is denoted by $c(G)$. Let $…