Pages that link to "Item:Q836992"
From MaRDI portal
The following pages link to Linearly independent vertices and minimum semidefinite rank (Q836992):
Displaying 27 items.
- Bounds for minimum semidefinite rank from superpositions and cutsets (Q389675) (← links)
- On the graph complement conjecture for minimum rank (Q417528) (← links)
- On the graph complement conjecture for minimum semidefinite rank (Q551287) (← links)
- The minimum semidefinite rank of a triangle-free graph (Q630548) (← links)
- The inertia set of the join of graphs (Q632470) (← links)
- Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs (Q649553) (← links)
- Orthogonal representations, minimum rank, and graph complements (Q924328) (← links)
- Zero forcing parameters and minimum rank problems (Q975607) (← links)
- The minimum rank of symmetric matrices described by a graph: a survey (Q996311) (← links)
- Lower bounds in minimum rank problems (Q1044621) (← links)
- Zero forcing number, Grundy domination number, and their variants (Q1713312) (← links)
- A new lower bound for the positive semidefinite minimum rank of a graph (Q1931723) (← links)
- On the relationships between zero forcing numbers and certain graph coverings (Q2017194) (← 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)
- Propagation tree decompositions and linearly independent vertices (Q2215974) (← links)
- Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues (Q2250939) (← links)
- Positive semidefinite zero forcing numbers of two classes of graphs (Q2319902) (← links)
- Positive semidefinite zero forcing (Q2435453) (← links)
- Unitary matrix digraphs and minimum semidefinite rank (Q2477544) (← links)
- Frame graph (Q4643723) (← links)
- (Q4685893) (← links)
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph (Q4908829) (← links)
- Bounds on minimum semidefinite rank of graphs (Q5175359) (← links)
- Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization (Q5737726) (← links)
- Graph complement conjecture for classes of shadow graphs (Q5862842) (← links)
- On the complexity of the positive semidefinite zero forcing number (Q5962481) (← links)
