AbstractA class of signed digraphs which arises naturally, in the theory of sign solvable linear systems is introduced. Several results are obtained concerning the structure of such graphs. Also an application is made revealing much of the structure of matrices of sign-solvable systems
AbstractRay solvable linear systems and ray S2NS matrices are complex generalizations of the sign so...
AbstractA signed graph is a graph with a sign attached to each arc. This article introduces the matr...
It is known that signed graphs with all cycles negative are those in which each block is a negative ...
AbstractA linear system of equations Ax=b is sign solvable if it is solvable and both its solvabilit...
AbstractA class of signed digraphs which arises naturally, in the theory of sign solvable linear sys...
AbstractA linear system of equations Ax=b is sign solvable if it is solvable and both its solvabilit...
AbstractLinear systems, Ax=b, for which the sign patterns A and b completely determine the set of si...
AbstractThe structure of sign-solvable and strongly sign-solvable systems is studied here by a refin...
AbstractA characterization of sign solvable graphs is presented together with a polynomial algorithm...
AbstractFor a real matrix A, Q(A) denotes the set of all matrices with the same sign pattern as A. A...
AbstractLinear systems, Ax=b, for which the sign patterns A and b completely determine the set of si...
AbstractA linear system of equations Ax=b is called sign inconsistent if for each matrix (A′,b′) wit...
AbstractA square real matrix A is called a strong sign nonsingular matrix (S2NS matrix) if all the m...
Sign-solvable linear systems are part of a branch of mathematics called qualitative matrix theory. Q...
In this paper we introduced the new notions semifull signed graph and semifull line (block) signed g...
AbstractRay solvable linear systems and ray S2NS matrices are complex generalizations of the sign so...
AbstractA signed graph is a graph with a sign attached to each arc. This article introduces the matr...
It is known that signed graphs with all cycles negative are those in which each block is a negative ...
AbstractA linear system of equations Ax=b is sign solvable if it is solvable and both its solvabilit...
AbstractA class of signed digraphs which arises naturally, in the theory of sign solvable linear sys...
AbstractA linear system of equations Ax=b is sign solvable if it is solvable and both its solvabilit...
AbstractLinear systems, Ax=b, for which the sign patterns A and b completely determine the set of si...
AbstractThe structure of sign-solvable and strongly sign-solvable systems is studied here by a refin...
AbstractA characterization of sign solvable graphs is presented together with a polynomial algorithm...
AbstractFor a real matrix A, Q(A) denotes the set of all matrices with the same sign pattern as A. A...
AbstractLinear systems, Ax=b, for which the sign patterns A and b completely determine the set of si...
AbstractA linear system of equations Ax=b is called sign inconsistent if for each matrix (A′,b′) wit...
AbstractA square real matrix A is called a strong sign nonsingular matrix (S2NS matrix) if all the m...
Sign-solvable linear systems are part of a branch of mathematics called qualitative matrix theory. Q...
In this paper we introduced the new notions semifull signed graph and semifull line (block) signed g...
AbstractRay solvable linear systems and ray S2NS matrices are complex generalizations of the sign so...
AbstractA signed graph is a graph with a sign attached to each arc. This article introduces the matr...
It is known that signed graphs with all cycles negative are those in which each block is a negative ...
DOI
Add to ORKG