On the rank spread of graphs
From MaRDI portal
Publication:2879639
DOI10.1080/03081087.2011.567389zbMATH Open1241.05087OpenAlexW2058607214MaRDI QIDQ2879639FDOQ2879639
C. M.da Fonseca, Irene Sciriha
Publication date: 29 March 2012
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2011.567389
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Computation of minimal rank and path cover number for certain graphs
- On the Eigenvalues and Eigenvectors of a Class of Matrices
- Spectral multiplicity and splitting results for a class of qualitative matrices
- The maximum corank of graphs with a 2-separation
- A characterization of tridiagonal matrices
- Minimum-rank matrices with prescribed graph
- Hermitian Matrices, Eigenvalue Multiplicities, and Eigenvector Components
- On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree
- On the construction of graphs of nullity one
- On nut and core singular fullerenes
Cited In (2)
Recommendations
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph π π
- The minimum rank of symmetric matrices described by a graph: a survey π π
- Zero forcing sets and the minimum rank of graphs π π
- An upper bound for the minimum rank of a graph π π
- Title not available (Why is that?) π π
This page was built for publication: On the rank spread of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2879639)