The minimum rank of matrices and the equivalence class graph

DOI10.1016/j.laa.2007.07.002zbMath1129.15002OpenAlexW2092606461MaRDI QIDQ2459958

Cecília Perdigão, Rosário Fernandes

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

zbMATH Keywords

Hermitian matricesundirected connected graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (2)

Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows ⋮ Some mixed graphs with \(H\)-rank 4, 6 or 8

Cites Work

• Spectral multiplicity and splitting results for a class of qualitative matrices
• On the minimum rank of the join of graphs and decomposable graphs
• On the maximum multiplicity of an eigenvalue in a matrix whose graph contains exactly one cycle
• Forbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\)
• Problems in algebraic combinatorics
• Computation of minimal rank and path cover number for certain graphs
• On the difference between the maximum multiplicity and path cover number for tree-like graphs
• Matrix Analysis
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• Graphs whose minimal rank is two
• Spectral graph theory and the inverse eigenvalue problem of a graph
• Graphs whose minimal rank is two: The finite fields case
• A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
• On the Eigenvalues and Eigenvectors of a Class of Matrices

This page was built for publication: The minimum rank of matrices and the equivalence class graph