Ordering trees with algebraic connectivity and diameter

Linear Algebra and Its Applications

Volumn 427, Issue 2-3, 2007, Pages 301-312

  Zhang, Xiao Dong ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

Algebraic connectivity; Diameter; Laplacian matrix; Tree

Indexed keywords

LINEAR ALGEBRA; PROBLEM SOLVING;

ALGEBRAIC CONNECTIVITY; LAPLACIAN MATRIX; ORDERING TREES;

TREES (MATHEMATICS);

EID: 34648814408     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2007.07.018     Document Type: Article

References (19)

1. de Abreu N.M.M. Old and new results on algebraic connectivity of graphs. Linear Algebra. Appl. 423 (2007) 53-73
2. Bondy J.A., and Murty U.S.R. Graph Theory with Applications (1976), Macmillan Press, New York
3. Cvetković D., Doob M., and Sachs H. Spectra of Graphs - Theory and Applications (1980), Academic Press, New Work (third ed., 1995)
4. Cvetković D., Doob M., Gutman I., and Torgasev A. Recent results in the theory of graph spectra. Ann. Discr. Math. 36 (1988), North-Holland
5. Fallat S., and Kirkland S. Extremizing algebraic connectivity subject to graph theoretic construct. Electron. J. Linear Algebra 3 (1998) 48-74
6. Fiedler M. Algebra connectivity of graphs. Czechoslovake Math. J. 23 98 (1973) 298-305
7. Fiedler M. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovake Math. J. 25 98 (1975) 607-618
8. Grone R., and Merris R. Ordering trees by algebraic connectivity. Graphs Combin. 6 (1990) 229-237
9. Grone R., Merris R., and Sunder V. The Laplacian spectrum of a graph. SIAM J. Matrix Anal. Appl. 11 (1990) 218-238
10. Horn R.A., and Johnson C.R. Matrix Analysis (1985), Cambridge University Press, London
11. Kirkland S. A bound on the algebraic connectivity of a graph in terms of the number of cutpoints. Linear and Multilinear Algebra 47 (2000) 93-103
12. Kirkland S. An upper bound on the algebraic connectivity of graphs with many cutpoints. Electron. J. Linear Algebra 8 (2001) 94-109
13. Lu M., Zhang L.Z., and Tian F. Lower bounds of the Laplacian spectrum of graphs based on diameter. Linear Algebra Appl. 420 (2006) 400-406
14. Marshal A.W., and Olkin I. Inequalities: Theorey of Majorization and its Applications (1979), Academic Press, New York
15. Merris R. Laplacian matrices of graphs: a survey. Linear Algebra Appl. 197/198 (1994) 143-176
16. Merris R. A survey of graph Lpalacians. Linear and Multilinear Algebra 39 (1995) 19-31
17. Mohar B. Eigenvalues, diameter, and means distance in grpahs. Graphs Combin. 7 (1991) 53-64
18. Mohar B. Laplace eigenvalues of graphs - a survey. Discrete Math. 109 (1992) 171-183
19. Molitierno J., and Neumann M. On trees with perfect matchings. Linear Algebra Appl. 362 (2003) 75-85