Faculty Publications

Title

On the Minimum Semidefinite Rank of a Simple Graph

SelectedWorks Author Profiles:

Lon Mitchell

Document Type

Article

Publication Date

2011

ISSN

0308-1087 (Print) 1563-5139 (Online)

Abstract

The minimum semidefinite rank (msr) of a graph is defined to be the minimum rank among all positive semidefinite matrices whose zero/ nonzero pattern corresponds to that graph. We recall some known facts and present new results, including results concerning the effects of vertex or edge removal from a graph on msr.

Publisher

Taylor & Francis

Share

COinS