A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph

Linear Algebra and Its Applications

Volumn 429, Issue 11-12, 2008, Pages 2770-2780

  Cardoso, Domingos M ^a   Cvetković, Dragoš ^b   Rowlinson, Peter ^c   Simić, Slobodan K ^b  

^a UNIVERSITY OF AVEIRO   (Portugal)

^b MATHEMATICAL INSTITUTE   (Serbia)

^c UNIVERSITY OF STIRLING   (United Kingdom)

Author keywords

Graph spectra; Graph theory; Least eigenvalue; Line graph; Signless Laplacian

Indexed keywords

CONTROL THEORY; EIGENVALUES AND EIGENFUNCTIONS; LAPLACE TRANSFORMS;

BIPARTITE GRAPHS; GRAPH SPECTRA; LAPLACIAN; LEAST EIGENVALUE; LINE GRAPH; LOWER BOUNDS; MINIMUM VALUES; SIGNLESS LAPLACIAN; UNICYCLIC GRAPHS;

GRAPH THEORY;

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

References (7)

1. Cvetković D., Doob M., and Sachs H. Spectra of Graphs. third ed. (1995), Johann Ambrosius Barth Verlag, Heidelberg, Leipzig
2. Cvetković D., Rowlinson P., and Simić S.K. Spectral Generalizations of Line Graphs (2004), Cambridge University Press, Cambridge
3. Cvetković D., Rowlinson P., and Simić S.K. Signless Laplacians of finite graphs. Linear Algebra Appl. 423 (2007) 155-171
4. Cvetković D., Rowlinson P., and Simić S.K. Eigenvalue bounds for the signless Laplacian. Publ. Inst. Math. (Beograd) 81 95 (2007) 11-27
5. van Dam E.R., and Haemers W.H. Which graphs are determined by their spectrum?. Linear Algebra Appl. 373 (2003) 241-272
6. Desai M., and Rao V. A characterization of the smallest eigenvalue of a graph. J. Graph Theory 18 (1994) 181-194
7. Fallat S.M., Kirkland S., and Pati S. Minimizing algebraic connectivity over connected graphs with fixed girth. Discrete Math. 254 (2002) 115-142