On the rank spread of graphs
From MaRDI portal
Publication:2879639
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
- scientific article; zbMATH DE number 3882475
Cites work
- A characterization of tridiagonal matrices
- Computation of minimal rank and path cover number for certain graphs
- Hermitian Matrices, Eigenvalue Multiplicities, and Eigenvector Components
- Minimum-rank matrices with prescribed graph
- On nut and core singular fullerenes
- On the Eigenvalues and Eigenvectors of a Class of Matrices
- On the construction of graphs of nullity one
- On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree
- Spectral multiplicity and splitting results for a class of qualitative matrices
- The maximum corank of graphs with a 2-separation
Cited in
(3)
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)