Graphs whose minimal rank is two: The finite fields case
From MaRDI portal
Publication:4656586
DOI10.13001/1081-3810.1175zbMath1102.05037OpenAlexW2109330174MaRDI QIDQ4656586
Hein van der Holst, Raphael Loewy, Wayne W. Barrett
Publication date: 11 March 2005
Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/126798
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hermitian, skew-Hermitian, and related matrices (15B57) Structural characterization of families of graphs (05C75) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items (10)
The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample ⋮ Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph ⋮ On the minimum rank of the join of graphs and decomposable graphs ⋮ Graphs with real algebraic co-rank at most two ⋮ The inverse inertia problem for the complements of partial \(k\)-trees ⋮ The minimum rank of matrices and the equivalence class graph ⋮ 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 ⋮ On the minimum rank of a graph over finite fields
This page was built for publication: Graphs whose minimal rank is two: The finite fields case