کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5773046 | 1631071 | 2017 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Mixed graphs with H-rank 3
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
In the article (Mohar, 2016 [9]), Mohar determined all mixed graphs with H-rank 2, and used it to classify cospectral graphs with respect to their Hermitian adjacency matrix, constructing a class of graphs which can not be determined by their H-spectrum. In the present paper, we investigate the H-rank of mixed graphs further, determining the H-ranks of those mixed graphs with trees, cycles and complete bipartite graphs as underlying graphs, respectively. Moreover, we characterize all mixed graphs with H-rank 3, and show that all connected mixed graphs with H-rank 3 can be determined by their H-spectrum.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 524, 1 July 2017, Pages 22-34
Journal: Linear Algebra and its Applications - Volume 524, 1 July 2017, Pages 22-34
نویسندگان
Yi Wang, Bo-Jun Yuan, Shuang-Dong Li, Chong-Jun Wang,