کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4602528 1631169 2008 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله
Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
چکیده انگلیسی

The spread of a graph is defined to be the difference between the largest eigenvalue and the least eigenvalue of the adjacency matrix of the graph. Let denote the set of connected unicyclic graphs of order n and girth k, and let Un denote the set of connected unicyclic graphs of order n. In this paper, we determine the unique graph with minimum least eigenvalue (respectively, the unique graph with maximum spread) among all graphs in . We, finally, characterize the unique graph with minimum least eigenvalue (respectively, the unique graph with maximum spread) among all graphs in Un.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 429, Issues 2–3, 15 July 2008, Pages 577-588