Indexed by：
Abstract：
Let τ(G), λ2(G), μn-1(G) and ρ2(G) be the maximum number of edge-disjoint spanning trees, the second largest adjacency eigenvalue, the algebraic connectivity, and the second largest signless Laplace eigenvalue of G, respectively. In this note, we prove that for any graph G with minimum degree δ≥2k, if λ2(G)1(G)＞2k- 1δ+1 or ρ2(G)
Keyword：
Reprint 's Address：
Email：
Source ：
Linear Algebra and Its Applications
ISSN： 0024-3795
Year： 2014
Volume： 458
Page： 128-133
0 . 9 3 9
JCR@2014
1 . 0 0 0
JCR@2023
ESI HC Threshold：86
JCR Journal Grade：1
CAS Journal Grade：2
Cited Count：
SCOPUS Cited Count： 26
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 3
Affiliated Colleges：
