Yong-Bin Gao

Some results on the distance spectral radius and edge-disjoint spanning trees of graphs

Let $\tau(G)$ denote the maximum number of edge-disjoint spanning trees in a connected graph $G$ of order $n$, and let $\rho_D(G)$ denote its distance spectral radius. For an integer $k\ge2$, Fan, He and Zhao [Discrete Appl. Math. 376 (2025) 31--40] obtained a sharp distance spectral radius condition for $\tau(G)\ge k$...