EMIS ELibM Electronic Journals Publications de l'Institut Mathématique, Nouvelle Série
Vol. 81(95), pp. 11–27 (2007)

Previous Article

Next Article

Contents of this Issue

Other Issues

ELibM Journals

ELibM Home

EMIS Home

Pick a mirror

 		 

EIGENVALUE BOUNDS
FOR THE SIGNLESS LAPLACIAN

Dragos Cvetkovic, Peter Rowlinson and Slobodan Simic

Matematicki institut SANU, Kneza Mihaila 36, 11000 Beograd, p.p. 367, Serbia; Department of Computing Science and Mathematics, University of Stirling, Stirling FK9 4LA, Scotland and Matematicki institut SANU, Kneza Mihaila 36, 11000 Beograd, p.p. 367, Serbia

Abstract: We extend our previous survey of properties of spectra of signless Laplacians of graphs. Some new bounds for eigenvalues are given, and the main result concerns the graphs whose largest eigenvalue is maximal among the graphs with fixed numbers of vertices and edges. The results are presented in the context of a number of computer-generated conjectures.

Keywords: graph theory, graph spectra, line graph, signless Laplacian

Classification (MSC2000): 05C50

Full text of the article: (for faster download, first choose a mirror)

Electronic fulltext finalized on: 20 Feb 2008. This page was last modified: 26 Feb 2008.

© 2008 Mathematical Institute of the Serbian Academy of Science and Arts
© 2008 ELibM and FIZ Karlsruhe / Zentralblatt MATH for the EMIS Electronic Edition