The Laplacian spectral radius of a graph under perturbation

Computers and Mathematics with Applications

Volumn 54, Issue 5, 2007, Pages 709-720

  Guo, Ji Ming ^a  

^a CHINA UNIVERSITY OF PETROLEUM   (China)

Author keywords

Characteristic polynomial; Eigenvector; Laplacian spectral radius

Indexed keywords

CHARACTERISTIC POLYNOMIAL; EIGENVECTOR; LAPLACIAN SPECTRAL RADIUS;

COMPUTATIONAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; LAPLACE EQUATION; PERTURBATION TECHNIQUES;

GRAPH THEORY;

EID: 34447322284     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2007.02.009     Document Type: Article

References (25)

1. Fiedler M. Algebraic connectivity of graphs. Czechoslovak Math. J. 23 98 (1973) 298-305
2. Mohar B. The Laplacian spectrum of graphs. Graph Theory Combin. Appl. 2 (1991) 871-898
3. Chung F.R.K., Faber V., and Manteuffel T.H. An upper bound on the diameter of a graph from eigenvalues associated with its Laplacian. SIAM J. Discrete Math. 7 3 (1994) 443-457
4. Lovász L. On the shannon capacity of a graph. IEEE Trans. Inform. Theory IT-25 (1979) 1-7
5. Mohar B. Eigenvalues, diameter, and mean distance in graphs. Graphs Combin. 7 (1994) 53-64
6. Gutman I., Gineityte V., Lepović M., and Petrović M. The high-energy band in the photoelectron spectrum of alkanes and its dependence on molecular structure. J. Serb. Chem. Soc. 64 (1999) 673-680
7. Gutman I., Vidović D., and Stevanović D. Chemical applications of the Laplacian spectrum. VI. On the largest Laplacian eigenvalue of alkanes. J. Serb. Chem. Soc. 67 (2002) 407-413
8. Delorme C., and Poljak S. Laplacian eigenvalues and the maximum cut problem. Math. Program. 62 (1993) 557-574
9. Delorme C., and Poljak S. Combinatorial properties and the complexity of a max-cut approximations. European J. Combin. 14 (1993) 313-333
10. Delorme C., and Poljak S. The performance of an eigenvalue bound on the max-cut problem in some classes of graphs. Discrete Math. 111 (1993) 145-156
11. Mohar B., and Poljak S. Eigenvalues and the max-cut problem. Czechoslovak Math. J. 40 (1990) 343-352
12. Mohar B., and Poljak S. Eigenvalues in combinatorial optimization. In: Brualdi R.A., Friedland S., and Klee V. (Eds). Combinatorial and Graph-Theoretical Problems in Linear Algebra. IMA Volumes in Mathematics and Its Applications vol. 50 (1993), Springer-Verlag 107-151
13. Poljak S., and Tuza Z. Maximum cuts and large bipartite subgraphs. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 20 (1995) 181-244
14. Solé P. Expanding and forwarding. Discrete Appl. Math. 58 (1995) 67-78
15. Merris R. Laplacian graph eigenvectors. Linear Algebra Appl. 278 (1998) 221-236
16. Grone R., Merris R., and Sunder V.S. The Laplacian spectrum of a graph. SIAM J. Matrix Anal. Appl. 11 2 (1990) 218-238
17. Grone R., and Merris R. The Laplacian spectrum of graph II. SIAM J. Discrete Math. 7 (1994) 221-229
18. Merris R. Laplacian matrices of graphs: A survey. Linear Alg. Appl. 197, 198 (1994) 143-176
19. Guo J.M. The effect on the Laplacian spectral radius of a graph by adding or grafting edges. Linear Algebra Appl. 413 (2006) 59-71
20. Horn R.A., and Johnson C.R. Matrix Analysis (1985), Cambridge University Press
21. Cvetković D.M., Rowlinson P., and Simic S. Eigenspaces of graphs (1997), Cambridge University Press, Cambridge p. 56-60
22. Hoffman A.J., and Smith J.H. On the spectral radii of topologically equivalent graphs. In: Fiedler M. (Ed). Recent Advances in Graph Theory (1975), Academic Praha 273-281
23. Guo J.M. On the Laplacian spectral radius of a tree. Linear Algebra Appl. 368 (2003) 379-385
24. Hong Y., and Zhang X.D. Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees. Discrete Math. 296 (2005) 187-197
25. Guo J.M. On the second largest Laplacian eigenvalue of trees. Linear Algebra Appl. 404 (2005) 251-261