Pages that link to "Item:Q4656586"
From MaRDI portal
The following pages link to Graphs whose minimal rank is two: The finite fields case (Q4656586):
Displaying 10 items.
- On the minimum rank of a graph over finite fields (Q765180) (← links)
- The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample (Q836996) (← links)
- On the minimum rank of the join of graphs and decomposable graphs (Q869896) (← links)
- On minimum rank and zero forcing sets of a graph (Q967512) (← 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)
- Graphs with real algebraic co-rank at most two (Q1668987) (← links)
- The inverse inertia problem for the complements of partial \(k\)-trees (Q2435477) (← links)
- The minimum rank of matrices and the equivalence class graph (Q2459958) (← links)
- Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph (Q5060771) (← links)