Graphs whose minimal rank is two: The finite fields case
From MaRDI portal
Recommendations
Cited in
(14)- Graphs with real algebraic co-rank at most two
- Subgraph complementation and minimum rank
- The inverse inertia problem for the complements of partial \(k\)-trees
- The minimum rank of matrices and the equivalence class graph
- On minimal rank over finite fields
- Minimum rank of a graph over an arbitrary field
- Graphs whose minimal rank is two
- Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph
- On the minimum rank of a graph over finite fields
- The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
- On the minimum rank of the join of graphs and decomposable graphs
- On minimum rank and zero forcing sets of a graph
- The minimum rank of symmetric matrices described by a graph: a survey
- The minimum rank problem over the finite field of order 2: Minimum rank 3
This page was built for publication: Graphs whose minimal rank is two: The finite fields case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4656586)