Pages that link to "Item:Q3006563"

The following pages link to On the minimum semidefinite rank of a simple graph (Q3006563):

Displaying 20 items.

• Bounds for minimum semidefinite rank from superpositions and cutsets (Q389675) (← links)
• Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs (Q649553) (← links)
• Linearly independent vertices and minimum semidefinite rank (Q836992) (← links)
• Orthogonal representations, minimum rank, and graph complements (Q924328) (← links)
• The minimum rank of symmetric matrices described by a graph: a survey (Q996311) (← links)
• Lower bounds in minimum rank problems (Q1044621) (← links)
• A new lower bound for the positive semidefinite minimum rank of a graph (Q1931723) (← links)
• On the minimum semidefinite rank of signed graphs (Q2133675) (← links)
• Vector representations of graphs and distinguishing quantum product states with one-way LOCC (Q2185850) (← links)
• The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic (Q2317668) (← links)
• On the tree cover number of a graph (Q2357664) (← links)
• Orthogonal representations of Steiner triple system incidence graphs (Q2404398) (← links)
• Unitary matrix digraphs and minimum semidefinite rank (Q2477544) (← links)
• Frame graph (Q4643723) (← links)
• (Q4685893) (← links)
• (Q5139648) (← links)
• Bounds on minimum semidefinite rank of graphs (Q5175359) (← links)
• Graph complement conjecture for classes of shadow graphs (Q5862842) (← links)
• The minimum rank problem for circulants (Q5962494) (← links)
• Chordal graphs and distinguishability of quantum product states (Q6541336) (← links)