کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4600236 1336842 2012 21 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
The spectral characterization of ∞-graphs
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله
The spectral characterization of ∞-graphs
چکیده انگلیسی

A ∞-graph B(r,s) is a graph consisting of two cycles Cr+1 and Cs+1 with just a vertex in common. Fan and Luo in Theorem 4.4 [8], alleged that a ∞-graph is determined by its adjacency spectrum if it contains no cycle C4. However, according to Theorem 6.3 [16], we find that the result in Theorem 4.4 [8] is not completely correct. In this paper, we prove that B(r,s) is DAS if and only if s≠=r+2, and B(r,s) has a unique cospectral mate if s=r+2.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 437, Issue 7, 1 October 2012, Pages 1482-1502