Minimum rank with zero diagonal
From MaRDI portal
graphmatrixmaximum nullityminimum rankperfect \([1, 2\)-factor]spanning generalized cyclezero diagonalzero forcing number
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vector spaces, linear dependence, rank, lineability (15A03) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57)
Recommendations
- Minimum matrix rank of k-regular (0,1) matrices
- scientific article; zbMATH DE number 1059231
- scientific article; zbMATH DE number 1271874
- On the minimum rank of regular classes of matrices of zeros and ones
- Minimum rank problems
- Diagonal entry restrictions in minimum rank matrices
- Minimal cp rank
- Zero forcing parameters and minimum rank problems
- Zero minors of total positive matrices
- Minimal zeros of copositive matrices
Cited in
(12)- Zero forcing and maximum nullity for hypergraphs
- Odd cycle zero forcing parameters and the minimum rank of graph blowups
- Fractional zero forcing via three-color forcing games
- Failed skew zero forcing on a graph
- scientific article; zbMATH DE number 1271874 (Why is no real title available?)
- scientific article; zbMATH DE number 7640506 (Why is no real title available?)
- Skew throttling
- On orthogonal matrices with zero diagonal
- Diagonal entry restrictions in minimum rank matrices
- Almost full rank matrices arising from transitive tournaments
- Graphs with bipartite complement that admit two distinct eigenvalues
- The classification of graphs on eight vertices with coinciding zero forcing number and maximum nullity
This page was built for publication: Minimum rank with zero diagonal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501682)