Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4602373 | Linear Algebra and its Applications | 2008 | 9 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory