کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
8897751 | 1631041 | 2018 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
ترجمه فارسی عنوان
در رابطه بین رتبه تقسیم گراف یک محور و رتبه گرافیکی زیرین آن
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
اعداد جبر و تئوری
چکیده انگلیسی
An oriented graph GÏ is a digraph without loops and multiple arcs, where G is the underlying graph of GÏ. Let S(GÏ) denote the skew-adjacency matrix of GÏ, and A(G) be the adjacency matrix of G. The rank (resp. skew-rank) of G (resp. GÏ), written as r(G) (resp. sr(GÏ)), refers to the rank of A(G) (resp. S(GÏ)). It is natural and interesting to study the relationship between sr(GÏ) and r(G). Wong, Ma and Tian (European J. Combin. 54 (2016) 76-86) [30] determined the sharp upper bound on sr(GÏ)âr(G). As a continuance of it, in this paper, a sharp lower bound on sr(GÏ)âr(G) is determined; as well a sharp upper bound on sr(GÏ)/r(G) is determined. All the corresponding extremal oriented graphs GÏ are characterized, respectively.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 554, 1 October 2018, Pages 205-223
Journal: Linear Algebra and its Applications - Volume 554, 1 October 2018, Pages 205-223
نویسندگان
Wenjun Luo, Jing Huang, Shuchao Li,