کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4602373 1631170 2008 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Orthogonal representations, minimum rank, and graph complements
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله
Orthogonal representations, minimum rank, and graph complements
چکیده انگلیسی

Orthogonal representations are used to show that complements of certain sparse graphs have (positive semidefinite) minimum rank at most 4. This bound applies to the complement of a 2-tree and to the complement of a unicyclic graph. Hence for such graphs, the sum of the minimum rank of the graph and the minimum rank of its complement is at most two more than the order of the graph. The minimum rank of the complement of a 2-tree is determined exactly.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 428, Issues 11–12, 1 June 2008, Pages 2560-2568