The minimum rank of matrices and the equivalence class graph
From MaRDI portal
Publication:2459958
Recommendations
Cites work
- A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
- Computation of minimal rank and path cover number for certain graphs
- Forbidden minors for the class of graphs G with (G) 2
- Graphs whose minimal rank is two
- Graphs whose minimal rank is two: The finite fields case
- Matrix Analysis
- On the Eigenvalues and Eigenvectors of a Class of Matrices
- On the difference between the maximum multiplicity and path cover number for tree-like graphs
- On the maximum multiplicity of an eigenvalue in a matrix whose graph contains exactly one cycle
- On the minimum rank of the join of graphs and decomposable graphs
- Problems in algebraic combinatorics
- Spectral graph theory and the inverse eigenvalue problem of a graph
- Spectral multiplicity and splitting results for a class of qualitative matrices
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
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)