Spectral radius and edge-disjoint spanning trees

Dandan Fan, Xiaofeng Gu, Huiqiu Lin

The spanning tree packing number of a graph $G$, denoted by $\tau (G)$, is the maximum number of edge-disjoint spanning trees contained in $G$. The study of $\tau (G)$ is one of the classi…