Ordering trees by algebraic connectivity
Authors:
- 1 September 1990
- journal article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 6 (3) , 229-237
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A bound for the permanent of the Laplacian matrixLinear Algebra and its Applications, 1986
- Eigenvalues of the Laplacian of a graph∗Linear and Multilinear Algebra, 1985
- Permanental roots and the star degree of a graphLinear Algebra and its Applications, 1985
- Permanent of the Laplacian matrix of trees and bipartite graphsDiscrete Mathematics, 1984
- Schur convex functions on the spectra of graphsDiscrete Mathematics, 1983
- Nonisomorphic trees with the same T-polynomialInformation Processing Letters, 1977
- Graph theory and the statistics and dynamics of polymer chainsThe Journal of Chemical Physics, 1976
- A property of eigenvectors of nonnegative symmetric matrices and its application to graph theoryCzechoslovak Mathematical Journal, 1975
- Algebraic Graph Theory1974
- Algebraic connectivity of graphsCzechoslovak Mathematical Journal, 1973