A note on minimum rank and maximum nullity of sign patterns
From MaRDI portal
Publication:3091555
DOI10.13001/1081-3810.1435zbMath1223.15037OpenAlexW68255878MaRDI QIDQ3091555
Publication date: 9 September 2011
Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/232693
matrixsign patternedit distanceminimum rankmaximum nullitypath cover numberasymmetric minimum rankditreetree sign patternSNS numberSNS sign pattern
Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vector spaces, linear dependence, rank, lineability (15A03) Communication theory (94A05) Sign pattern matrices (15B35)
Related Items
A new lower bound for the positive semidefinite minimum rank of a graph, Linear algebraic methods in communication complexity, Zero forcing for sign patterns