کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4599892 | 1336826 | 2013 | 15 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Classes of graphs with minimum skew rank 4
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
The minimum skew rank of a simple graph G is the smallest possible rank among all real skew-symmetric matrices whose (i,j)-entry is nonzero if and only if the edge joining i and j is in G. It is known that a graph has minimum skew rank 2 if and only if it consists of a complete multipartite graph and some isolated vertices. Some necessary conditions for a graph to have minimum skew rank 4 are established, and several families of graphs with minimum skew rank 4 are given. Linear algebraic techniques are developed to show that complements of trees and certain outerplanar graphs have minimum skew rank 4.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 439, Issue 11, 1 December 2013, Pages 3643-3657
Journal: Linear Algebra and its Applications - Volume 439, Issue 11, 1 December 2013, Pages 3643-3657
نویسندگان
Sudipta Mallik, Bryan L. Shader,