کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5773399 | 1631078 | 2017 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Imprimitivity index of the adjacency matrix of digraphs
ترجمه فارسی عنوان
شاخص غیرمستقیم از ماتریس مجذور دیفرانسیل
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
اعداد جبر و تئوری
چکیده انگلیسی
Let G be a graph. An edge orientation of G is called smooth if the in-degree and the out-degree of every vertex differ by at most one. In this paper, we show that if G is a 2-edge-connected non-bipartite graph with δ(G)â¥3, then G has a smooth primitive orientation. Among other results, using the spectral radius of digraphs, we show that if D1 is a primitive regular orientation and D2 is a non-regular orientation of a given graph, then for sufficiently large t, the number of closed walks of length t in D1 is more than the number of closed walks of length t in D2.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 517, 15 March 2017, Pages 1-10
Journal: Linear Algebra and its Applications - Volume 517, 15 March 2017, Pages 1-10
نویسندگان
Saieed Akbari, Amir Hossein Ghodrati, Mohammad Ali Hosseinzadeh,