کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5776776 | 1413641 | 2017 | 17 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
It is well-known that the paths are determined by the spectrum of the adjacency matrix. For digraphs, every digraph whose underlying graph is a tree is cospectral to its underlying graph with respect to the Hermitian adjacency matrix (H-cospectral). Thus every (simple) digraph whose underlying graph is isomorphic to Pn is H-cospectral to Pn. Interestingly, there are others. This paper finds digraphs that are H-cospectral with the path graph Pn and whose underlying graphs are nonisomorphic, when n is odd, and finds that such graphs do not exist when n is even. In order to prove this result, all digraphs whose Hermitian spectral radius is smaller than 2 are determined.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 340, Issue 11, November 2017, Pages 2616-2632
Journal: Discrete Mathematics - Volume 340, Issue 11, November 2017, Pages 2616-2632
نویسندگان
Krystal Guo, Bojan Mohar,