Let $τ(G)$ and $κ'(G)$ denote the edge-connectivity and the spanning tree packing number of a graph $G$, respectively. Proving a conjecture initiated by Cioaba and Wong, Liu et al. in 2014 showed that for any simple graph $G$ with minimum degree $δ\ge 2k \ge 4$, if the second largest adjacency eigenvalue of $G$ satisfies $λ_2(G) < δ- \frac{2k-1}{δ+1}$, then $τ(G) \ge k$. Similar results involving the Laplacian eigenvalues and the signless Laplacian eigenvalues of $G$ are also obtained. In this paper, we find a function $f(δ, k, g)$ such that for every graph $G$ with minimum degree $δ\ge 2k \ge 4$ and girth $g \ge 3$, if its second largest adjacency eigenvalue satisfies $λ_2(G) < f(δ, k, g)$, then $τ(G) \ge k$. As $f(δ, k, 3) = δ- \frac{2k-1}{δ+1}$, this extends the above-mentioned result of Liu et al. Related results involving the girth of the graph, Laplacian eigenvalues and the signless Laplacian eigenvalues to describe $τ(G)$ and $κ'(G)$ are also obtained.