Pages that link to "Item:Q1044621"
From MaRDI portal
The following pages link to Lower bounds in minimum rank problems (Q1044621):
Displaying 12 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)
- Zero forcing parameters and minimum rank problems (Q975607) (← links)
- A new lower bound for the positive semidefinite minimum rank of a graph (Q1931723) (← links)
- On extremal graphs for zero forcing number (Q2102756) (← links)
- Orthogonal representations of Steiner triple system incidence graphs (Q2404398) (← links)
- Positive semidefinite zero forcing (Q2435453) (← links)
- Graphs of unitary matrices and positive semidefinite zero forcing (Q2447097) (← links)
- Frame graph (Q4643723) (← links)
- Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph (Q5060771) (← links)
- Bounds on minimum semidefinite rank of graphs (Q5175359) (← links)
- Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization (Q5737726) (← links)
