Further results on the least eigenvalue of connected graphs (original) (raw)

Further results on the least eigenvalue of connected graphs

Linear Algebra and Its Applications, 2011

Abstract

In this paper, we identify within connected graphs of order n and size n+k (with 0⩽k⩽4 and n⩾k+5) the graphs whose least eigenvalue is minimal. It is also observed that the same graphs have the largest spectral spread if n is large enough.

Tatjana Aleksic hasn't uploaded this paper.

Let Tatjana know you want this paper to be uploaded.

Ask for this paper to be uploaded.