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.
This is a manuscript of an article from Linear Algebra and its Applications 428 (2008); 2560, doi:10.1016/j.laa.2007.12.004. Posted with permission.