کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4599158 | 1631124 | 2015 | 17 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Spectral characterization of unicyclic graphs whose second largest eigenvalue does not exceed 1
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Spectral characterization of unicyclic graphs whose second largest eigenvalue does not exceed 1 Spectral characterization of unicyclic graphs whose second largest eigenvalue does not exceed 1](/preview/png/4599158.png)
چکیده انگلیسی
Connected graphs with the same number of vertices and edges are called unicyclic graphs. All unicyclic graphs whose second largest eigenvalue does not exceed 1, denoted by U(λ2), are determined by Xu [10]. Let Gt,s denote the graph obtained by attaching tâ¥1 pendent paths of length 2 and sâ¥0 pendent edges to a vertex of a triangle. In this paper, we first prove that the graph Gt,s is determined by its adjacency spectrum. Then we prove that the graphs in U(λ2) are determined by their adjacency spectra except for four graphs.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 471, 15 April 2015, Pages 587-603
Journal: Linear Algebra and its Applications - Volume 471, 15 April 2015, Pages 587-603
نویسندگان
Xiaoling Ma, Qiongxiang Huang, Fenjin Liu,