On the digraphs of sign solvable linear systems
This paper belongs to qualitative matrix theory, that is, the study of properties of matrices which depend only on the signs (0,1,-1) of entries and not on their magnitudes. The qualitative class \(Q(A)\) of a matrix \(A\) is the set of matrices with the same sign pattern as \(A\). A linear system \(Ax=b\) of equations which is solvable for \(x\), is said to be sign-solvable if \(Q(x)\) is completely determined by \(Q(A)\) and \(Q(b)\). The signed digraph associated with a square matrix \(A\) is the digraph whose vertices correspond to rows (columns) of \(A\) and arcs correspond to the non-zero entries of \(A\). Arcs are labelled with the sign of the corresponding entry. The purpose of this paper is to characterise the signed digraphs of the matrices which represent sign-solvable linear systems. The characterisation involves a class of forbidden sub-digraphs.
- Bipartite graphs and inverse sign patterns of strong sign-nonsingular matrices
- Characterization of even directed graphs
- Full sign-invertibility and symplectic matrices
- Graph-theoretical approach to qualitative solvability of linear systems
- scientific article; zbMATH DE number 825098 (Why is no real title available?)
- On digraphs with the odd cycle property
- Qualitative Economics and the Scope of the Correspondence Principle
- Recognizing sign solvable graphs
- Rectangular \(L\)-matrices
- Sign solvable graphs
- Sign-nonsingular matrices and even cycles in directed graphs
- Signsolvability revisited
- The Even Cycle Problem for Directed Graphs
- When the sign pattern of a square matrix determines uniquely the sign pattern of its inverse
- Recursive structure of S-matrices and an O(m^ 2) algorithm for recognizing sign solvability
- The graphs of the unambiguous entries in the product of two \((+,-)\) sign pattern matrices
- Linear systems with signed solutions
- Algebraic constructions of the minimal forbidden digraphs of strong sign nonsingular matrices
- Conditional sign-solvability
- The S^2NS digraphs and the cycle linear system of a digraph
- A note on sign-solvability of linear system of equations
- scientific article; zbMATH DE number 123736 (Why is no real title available?)
- Partly zero eigenvectors and matrices that satisfyAu=b
- Sign-Solvable Cone-Systems
- The underlying line digraph structure of some (0, 1)-matrix equations
- Signsolvability revisited
This page was built for publication: On the digraphs of sign solvable linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1579516)