The following pages link to Graphs whose minimal rank is two (Q4656572):
Displaying 48 items.
- The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph (Q332633) (← links)
- Bounds for minimum semidefinite rank from superpositions and cutsets (Q389675) (← links)
- On the graph complement conjecture for minimum rank (Q417528) (← links)
- Computing inertia sets using atoms (Q417545) (← links)
- The minimum semidefinite rank of the complement of partial \(k\)-trees (Q627949) (← 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)
- Linearly independent vertices and minimum semidefinite rank (Q836992) (← links)
- The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample (Q836996) (← links)
- Minimum rank problems (Q848577) (← links)
- Minimal regular 2-graphs and applications (Q854642) (← links)
- Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns (Q855530) (← links)
- On the minimum rank of the join of graphs and decomposable graphs (Q869896) (← links)
- Forbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\) (Q876301) (← links)
- Orthogonal representations, minimum rank, and graph complements (Q924328) (← links)
- Three-connected graphs whose maximum nullity is at most three (Q929488) (← links)
- On acyclic and unicyclic graphs whose minimum rank equals the diameter (Q947619) (← links)
- An upper bound for the minimum rank of a graph (Q947626) (← links)
- Minimum rank of skew-symmetric matrices described by a graph (Q962078) (← links)
- On minimum rank and zero forcing sets of a graph (Q967512) (← links)
- Techniques for determining the minimum rank of a small graph (Q967515) (← links)
- The minimum rank of symmetric matrices described by a graph: a survey (Q996311) (← links)
- The minimum rank problem over the finite field of order 2: Minimum rank 3 (Q999773) (← links)
- Lower bounds in minimum rank problems (Q1044621) (← links)
- Graphs with real algebraic co-rank at most two (Q1668987) (← links)
- Computation of minimal rank and path cover number for certain graphs (Q1887507) (← links)
- On extremal graphs for zero forcing number (Q2102756) (← links)
- On the minimum semidefinite rank of signed graphs (Q2133675) (← links)
- Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph'' (Q2217786) (← links)
- Graphs with few trivial characteristic ideals (Q2229515) (← links)
- Critical ideals, minimum rank and zero forcing number (Q2279368) (← links)
- Achievable multiplicity partitions in the inverse eigenvalue problem of a graph (Q2302881) (← links)
- Positive semidefinite zero forcing (Q2435453) (← links)
- The inverse inertia problem for the complements of partial \(k\)-trees (Q2435477) (← links)
- Graphs that allow all the eigenvalue multiplicities to be even (Q2451699) (← links)
- The minimum rank of matrices and the equivalence class graph (Q2459958) (← links)
- The maximum corank of graphs with a 2-separation (Q2477537) (← links)
- Zero forcing sets and the minimum rank of graphs (Q2477541) (← links)
- Rational realizations of the minimum rank of a sign pattern matrix (Q2568989) (← links)
- The inertia set of a signed graph (Q2637138) (← links)
- Maximum nullity and zero forcing of circulant graphs (Q2663691) (← links)
- (Q4642889) (← links)
- Techniques for determining equality of the maximum nullity and the zero forcing number of a graph (Q4989750) (← links)
- Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph (Q5060771) (← links)
- Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization (Q5737726) (← links)
- The minimum rank problem for circulants (Q5962494) (← links)
- Sparks of symmetric matrices and their graphs (Q6202068) (← links)
- On the zero forcing number of the complement of graphs with forbidden subgraphs (Q6635254) (← links)
