کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6416759 | 1336855 | 2013 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Enumeration of graphs with the same Ihara zeta function
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
We enumerate all connected graphs with minimal vertex degree 2 on at most 11 vertices and determine their Ihara zeta functions. We also count the number of such graphs for which there is another graph with the same zeta function. We then use these graphs to conjecture properties of the graphs determined by the zeta function. In addition, we study switching constructions, proposed by Godsil and McKay, to determine whether they preserve the zeta function. We show that GM switching is not strong enough to preserve the zeta function, but GMâ switching, following the notation of Haemers and Spence, does preserve the zeta function.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 438, Issue 1, 1 January 2013, Pages 564-572
Journal: Linear Algebra and its Applications - Volume 438, Issue 1, 1 January 2013, Pages 564-572
نویسندگان
A. Setyadi, C.K. Storm,