Graphs for which the least eigenvalue is minimal, II

Citation

Bell FK, Cvetkovic D, Rowlinson P & Simic SK (2008) Graphs for which the least eigenvalue is minimal, II. Linear Algebra and Its Applications, 429 (8-9), pp. 2168-2179. https://doi.org/10.1016/j.laa.2008.06.018

Abstract
We continue our investigation of graphs G for which the least eigenvalue ?(G) is minimal among the connected graphs of prescribed order and size. We provide structural details of the bipartite graphs that arise, and study the behaviour of ?(G) as the size increases while the order remains constant. The non-bipartite graphs that arise were investigated in a previous paper [F.K. Bell, D. Cvetkovic', P. Rowlinson, S.K. Simic', Graphs for which the least eigenvalue is minimal, I, Linear Algebra Appl. (2008), doi: 10.1016/j.laa.2008.02.032]; here we distinguish the cases of bipartite and non-bipartite graphs in terms of size. Erratum is published in: Richard A Brualdi, 'From the Editor-in-Chief', Linear Algebra Applications, 432(1) pp.1-6, 01/2010  

Keywords
Bipartite graph; Graph spectrum; Largest eigenvalue; Least eigenvalue

Journal
Linear Algebra and Its Applications: Volume 429, Issue 8-9

People

Professor Peter Rowlinson

Emeritus Professor, Mathematics