کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4602347 1631167 2008 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Graphs for which the least eigenvalue is minimal, II
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله
Graphs for which the least eigenvalue is minimal, II
چکیده انگلیسی

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. Cvetković, P. Rowlinson, S.K. Simić, 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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 429, Issues 8–9, 16 October 2008, Pages 2168-2179