The relationship between triangle size and minimum rank for 7 7 zero-nonzero patterns
DOI10.1080/09720529.2019.1614247zbMATH Open1495.05175OpenAlexW2954648220MaRDI QIDQ5036729FDOQ5036729
Publication date: 23 February 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2019.1614247
Recommendations
- The relationship between maximum triangle size and minimum rank for zero-nonzero patterns
- The extent to which triangular sub-patterns explain minimum rank
- Minimum number of non-zero-entries in a \(7 \times 7\) stable matrix
- On the possible ranks among matrices with a given pattern
- The minimum rank problem for a linear directed 2-tree
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Eigenvalues, singular values, and eigenvectors (15A18) Vector spaces, linear dependence, rank, lineability (15A03) Sign pattern matrices (15B35)
Cites Work
- An upper bound for the minimum rank of a graph
- Minimum rank of skew-symmetric matrices described by a graph
- On the minimum rank of not necessarily symmetric matrices: A preliminary study
- The relationship between maximum triangle size and minimum rank for zero-nonzero patterns
- The extent to which triangular sub-patterns explain minimum rank
Cited In (2)
This page was built for publication: The relationship between triangle size and minimum rank for \(7 \times 7\) zero-nonzero patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5036729)