Pages that link to "Item:Q1414690"
From MaRDI portal
The following pages link to Graphs whose positive semi-definite matrices have nullity at most two (Q1414690):
Displayed 21 items.
- Bounds for minimum semidefinite rank from superpositions and cutsets (Q389675) (← links)
- On the graph complement conjecture for minimum rank (Q417528) (← links)
- The minimum semidefinite rank of a triangle-free graph (Q630548) (← links)
- Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs (Q649553) (← links)
- Linearly independent vertices and minimum semidefinite rank (Q836992) (← links)
- The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample (Q836996) (← 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)
- Orthogonal representations of Steiner triple system incidence graphs (Q2404398) (← links)
- Positive semidefinite zero forcing (Q2435453) (← links)
- Unitary matrix digraphs and minimum semidefinite rank (Q2477544) (← links)
- On the minimum semidefinite rank of a simple graph (Q3006563) (← links)
- The graphs for which the maximum multiplicity of an eigenvalue is two (Q3399125) (← links)
- Frame graph (Q4643723) (← links)
- (Q4685893) (← links)
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph (Q4908829) (← 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)