Bounds for minimum semi-definite rank of a graph using superpositions and cut sets

Research output: Other contribution

Original languageEnglish
StatePublished - Oct 14 2011

Fingerprint

Dive into the research topics of 'Bounds for minimum semi-definite rank of a graph using superpositions and cut sets'. Together they form a unique fingerprint.

Cite this