کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4599777 1631152 2014 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphs
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله
On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphs
چکیده انگلیسی

The connected graphs with least distance eigenvalues in [−2.383,0][−2.383,0] and the trees with least distance eigenvalues in (−2−2,0] have been known. We determine the trees with least distance eigenvalues in [−3−5,−2−2] and the unicyclic and bicyclic graphs with least distance eigenvalues in (−2−2,−2.383). We also determine the trees with the kth largest least distance eigenvalues for every positive integer k up to 28, and the unicyclic and bicyclic graphs with the kth largest least distance eigenvalues respectively for any positive integer k.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 443, 15 February 2014, Pages 153–163
نویسندگان
, ,