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

Which graphs are determined by their spectrum?

Edwin van Dam, Willem H. Haemers · Linear Algebra and its Applications · 2003 · 677 citations

Natural Sciences, Astronomy, Combinatorics +6

Signless Laplacians of finite graphs

Dragoš Cvetković, Peter Rowlinson, Slobodan K. Simić · Linear Algebra and its Applications · 2007 · 490 citations · Full text

Natural Sciences, Mathematics, Combinatorics +4

Eigenvalue bounds for the signless laplacian

Dragoš Cvetković, Peter Rowlinson, Slobodan Simić · Publications de l Institut Mathematique · 2007 · 189 citations · Full text

Natural Sciences, Computer Science, Mathematics +12

A characterization of the smallest eigenvalue of a graph

Madhav P. Desai, Vasant B. Rao · Journal of Graph Theory · 1994 · 136 citations · Full text

Natural Sciences, Computer Science, Combinatorics +6

Minimizing algebraic connectivity over connected graphs with fixed girth

Shaun Fallat, Steve Kirkland, Sukanta Pati · Discrete Mathematics · 2002 · 38 citations

Natural Sciences, Computer Science, Mathematics +12