Eigenvalue bounds for the signless laplacian

Publications de l'Institut Mathematique

Volumn , Issue 95, 2007, Pages 11-27

  Cvetković, Dragoš ^a   Rowlinson, Peter ^b   Simić, Slobodan K ^a  

^a MATHEMATICAL INSTITUTE   (Serbia)

^b UNIVERSITY OF STIRLING   (United Kingdom)

Author keywords

Graph spectra; Graph theory; Line graph; Signless Laplacian

Indexed keywords

EID: 51849112953     PISSN: 03501302     EISSN: None     Source Type: Journal    
DOI: 10.2298/PIM0795011C     Document Type: Article

References (26)

1. M. Aouchiche, F. K. Bell, D. Cvetković, P. Hansen, P. Rowlinson, S. K. Simić, D. Stevanović, Variable neighborhood search for extremal graphs, 16. Some conjectures related to the largest eigenvalue of a graph, Europ. J. Oper. Res., to appear.
2. G. Caporossi, P. Hansen, Variable Neighborhood Search for Extremal Graphs I, Discrete Math., 212(2000), 29-44.
3. Y. Chen, Properties of spectra of graphs and line graphs, Appl. Math. J. Chinese Univ. Ser. B 17(3) (2002), 371-376.
4. D. Cvetković, Signless Laplacians and line graphs, Bull. Acad. Serbe Sci. Arts, Cl. Sci. Math. Natur., Sci. Math. 131 (2005), No. 30, 85-92.
5. D. Cvetković, M. Doob, H. Sachs, Spectra of Graphs, 3rd edition, Johann Ambrosius Barth Verlag, Heidelberg-Leipzig, 1995.
6. D. Cvetković, P. Rowlinson, S. Simić, Eigenspaces of Graphs, Cambridge University Press, Cambridge, 1997.
7. D. Cvetković, P. Rowlinson, S. K. Simić, Spectral Generalizations of Line Graphs, On Graphs with Least Eigenvalue - 2, Cambridge University Press, Cambridge, 2004.
8. D. Cvetković, P. Rowlinson, S. K. Simić, Signless Laplacians of finite graphs, Linear Algebra Appl. 423(2007), No. 1, 155-171.
9. E. R. van Dam, Graphs with few eigenvalues, Thesis, Tilburg University, Tilburg, 1996.
10. E. R. van Dam, W. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241-272.
11. A. Daneshgax, H. Hajiabolhassan, Graph homomorphisms and nodal domains, Linear Algebra Appl. 418(2006), 44-52.
12. E. Dedo, La reconstruibilita del polinomio carrateristico del comutato di un grafo, Boll. Unione Mat. Ital. 18A (1981), No. 5, 423-429.
13. M. Desai, V. Rao, A characterization of the smallest eigenvalue of a graph, J. Graph Theory 18 (1994), 181-194.
14. F. R. Gantmacher, Theory of Matrices I, II Chelsea, New York, 1960.
15. R. Grone, R. Merris, V. S. Sunder, The Laplacian spectrum of a graph, SIAM J. Matrix Anal. Appl. 11 (1990), 218-238.
16. W. Haemers, E. Spence, Enumeration of cospectral graphs, Europ. J. Comb. 25 (2004), 199-211.
17. Y. Hong, X.-D. Zhang, Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees, Discrete Math. 296 (2005), 187-197.
18. B. Mohar, Graph Laplacians, in: Topics in Algebraic Graph Theory (eds, L. W. Beineke, R. J. Wilson), Cambridge University Press, 2004, pp. 113-136.
19. R. Merris, Laplacian matrices of graphs, Linear Algebra Appl. 197-198(1994), 143-176.
20. C. S. Oliveira, N. M. M. de Abreu, S. Jurkiewicz, The characteristic polynomial of the Laplacian of graphs in (a, b)-linear classes, Linear Algebra Appl. 356(2002), 113-121.
21. Jia-yu Shao, Li Zhang, Xi-ying Yuan, On the second Laplacian eigenvalues of trees of odd order. Linear Algebra Appl. 419 (2006), no. 2-3, 475-485.
22. J.-L. Shu, Y. Hong, K. Wen-Ren, A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph, Linear Algebra Appl. 347(2002), 123-129.
23. S. K, Simić, E. M. Li Marzi, F. Belardo, Connected graphs of fixed order and size with maximal index: Structural, considerations, Le Matematiche 59 (2004), Nos. 1-2, 349-365.
24. E. V. Vahovskiǐ, On the eigenvalues of the neighbourhood matrix of simple graphs (Russian), Sibir. Mat. J. 6 (1965), 44-49.
25. B. Zhou, I. Gutman, A connection between ordinary and Laplacian spectra of bipartite graphs, Linear an Multilinear Algebra, to appear
26. P. Zhu, R. C. Wilson, A study of graph spectra for comparing graphs, to appear.