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

Let G be a connected graph whose least eigenvalue λ(G) is minimal among the connected graphs of prescribed order and size. We show first that either G is complete or λ(G) is a simple eigenvalue. In the latter case, the sign pattern of a corresponding eigenvector determines a partition of the vertex set, and we study the structure of G in terms of this partition. We find that G is either bipartite or the join of two graphs of a simple form.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 429, Issue 1, 1 July 2008, Pages 234-241