The minimum rank of matrices and the equivalence class graph
From MaRDI portal
Publication:2459958
DOI10.1016/J.LAA.2007.07.002zbMATH Open1129.15002OpenAlexW2092606461MaRDI QIDQ2459958FDOQ2459958
Authors: Rosário Fernandes, Cecília Perdigão
Publication date: 9 November 2007
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2007.07.002
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03)
Cites Work
- Matrix Analysis
- Problems in algebraic combinatorics
- Spectral graph theory and the inverse eigenvalue problem of a graph
- Computation of minimal rank and path cover number for certain graphs
- A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
- Forbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\)
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
- Graphs whose minimal rank is two
- On the Eigenvalues and Eigenvectors of a Class of Matrices
- Spectral multiplicity and splitting results for a class of qualitative matrices
- On the difference between the maximum multiplicity and path cover number for tree-like graphs
- On the minimum rank of the join of graphs and decomposable graphs
- Graphs whose minimal rank is two: The finite fields case
- On the maximum multiplicity of an eigenvalue in a matrix whose graph contains exactly one cycle
Cited In (9)
- A note on universally optimal matrices and field independence of the minimum rank of a graph
- Some mixed graphs with \(H\)-rank 4, 6 or 8
- On the minimum vector rank of multigraphs
- Minimum-rank matrices with prescribed graph
- Minimum rank of matrices described by a graph or pattern over the rational, real and complex numbers
- Determining the minimum rank of matroids whose basis graph is common
- On upper bounds for the minimum rank of regular classes of (0,1)-matrices
- Theta rank, levelness, and matroid minors
- Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows
This page was built for publication: The minimum rank of matrices and the equivalence class graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2459958)