کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4602594 | 1631171 | 2008 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On the polynomial reconstruction of graphs whose vertex-deleted subgraphs have spectra bounded from below by −2
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
We consider the problem of reconstructing the characteristic polynomial of a graph from its polynomial deck, i.e. the collection of characteristic polynomials of its vertex-deleted subgraphs. Here we provide a positive answer to this problem for graphs as in the title, provided they are disconnected. Since the same problem for connected graph was already answered in positive, we have arrived at the positive answer for the entire collection of graphs under considerations.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 428, Issues 8–9, 15 April 2008, Pages 1865-1873
Journal: Linear Algebra and its Applications - Volume 428, Issues 8–9, 15 April 2008, Pages 1865-1873