On trees with perfect matchings

Linear Algebra and Its Applications

Volumn 362, Issue , 2003, Pages 75-85

  Molitierno, Jason J ^a   Neumann, Michael ^b  

^a SACRED HEART UNIVERSITY   (United States)

^b UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84867973253     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(02)00454-8     Document Type: Article

References (10)

1. A. Ben-Israel, and T.N. Greville Generalized Inverses: Theory and Applications 1973 Academic Press New-York
2. A. Berman, and R.J. Plemmons Nonnegative Matrices in the Mathematical Sciences 1994 SIAM Philadelphia
3. S.L. Campbell, and C.D. Meyer Jr. Generalized Inverses of Linear Transformations 1991 Dover Publications New York
4. M. Fiedler Algebraic connectivity of graphs Czechoslovak Math. J. 23 1973 298 305
5. R. Grone, R. Merris, and V.S. Sunder The Laplacian spectrum of a graph SIMAX 11 1990 218 238
6. Y. Hou, J. Li, Bounds on the largest eigenvalue of trees with a given size of matching, Linear Algebra Appl. 342 (2002) 203-217
7. S. Kirkland, M. Neumann, and B. Shader Distances in weighted trees and group inverse of Laplacian matrices SIAM J. Matrix Anal. Appl. 18 1997 827 841
8. S.J. Kirkland, M. Neumann, and B. Shader Bounds on the subdominant eigenvalue involving group inverses with applications to graphs Czechoslovak Math. J. 47 1998 1 20
9. S.J. Kirkland, M. Neumann, and B. Shader On a bound on algebraic connectivity: the case of equality Czechoslovak Math. J. 48 1998 65 76
10. R. Merris Laplacian matrices and graphs: a survey Linear Algebra Appl. 197-198 1994 143 176