Toughness and distance spectral radius in graphs involving minimum degree

Abstract

The toughness $\tau \left(G\right)=\min \{\frac{\left|S\right|}{c(G-S)}:S\text{is a cut set of vertices in}G\}$ for $G\ncong K_n.$ The concept of toughness initially proposed by Chvátal in 1973, which serves as a simple way to measure how tightly various pieces of a graph hold together. A graph $G$ is called $t$-tough if $\tau \left(G\right)\ge t.$ It is very interesting to investigate the relations between toughness and eigenvalues of graphs. Fan, Lin and Lu [European J. Combin. 110 (2023) 103701] provided sufficient conditions in terms of the spectral radius for a graph to be 1-tough with minimum degree $\delta$ and $t$-tough with $t\ge 1$ being an integer, respectively. By using some typical distance spectral techniques and structural analysis, we in this paper present a sufficient condition based on the distance spectral radius to guarantee a graph to be 1-tough with minimum degree $\delta .$ Moreover, we also prove sufficient conditions with respect to the distance spectral radius for a graph to be $t$-tough, where $t$ or $\frac{1}{t}$ is a positive integer.