AbstractIn this paper, we obtain an inverse M-matrix completion, with zeros in the inverse completion, of a noncombinatorially symmetric partial inverse M-matrix, when the associated graph is acyclic without specified paths or, in the other case, when the subgraph induced by the vertices of any cycle or specified path is a clique
An $n \times n$ matrix is called an $N$--matrix if all principal minors are negative. In this paper...
AbstractAn n×n matrix is called an N-matrix if all principal minors are negative. In this paper, we ...
AbstractLet N={1,…,n}. Which subsets Q of N×N have the property that whenever aij for (i,j)∈Q form a...
AbstractIn this paper, we obtain an inverse M-matrix completion, with zeros in the inverse completio...
AbstractNecessary and sufficient conditions are given on the data for completability of a partial sy...
AbstractThe completion problems for M-matrices and inverse M-matrices are discussed. The former has ...
AbstractNecessary and sufficient conditions are given on the data for completability of a partial sy...
AbstractA list of positions in an n × n real matrix that includes all diagonal positions (a pattern)...
AbstractLet N={1,…,n}. Which subsets Q of N×N have the property that whenever aij for (i,j)∈Q form a...
AbstractThe symmetric M-matrix and symmetric M0-matrix completion problems are solved and results of...
AbstractThe completion problems for M-matrices and inverse M-matrices are discussed. The former has ...
Abstract The symmetric M-matrix and symmetric M0-matrix completion problems are solved and results o...
AbstractA list of positions in an n × n real matrix that includes all diagonal positions (a pattern)...
The symmetric M-matrix and symmetric M0-matrix completion problems are solved and results of Johnson...
AbstractThe symmetric M-matrix and symmetric M0-matrix completion problems are solved and results of...
An $n \times n$ matrix is called an $N$--matrix if all principal minors are negative. In this paper...
AbstractAn n×n matrix is called an N-matrix if all principal minors are negative. In this paper, we ...
AbstractLet N={1,…,n}. Which subsets Q of N×N have the property that whenever aij for (i,j)∈Q form a...
AbstractIn this paper, we obtain an inverse M-matrix completion, with zeros in the inverse completio...
AbstractNecessary and sufficient conditions are given on the data for completability of a partial sy...
AbstractThe completion problems for M-matrices and inverse M-matrices are discussed. The former has ...
AbstractNecessary and sufficient conditions are given on the data for completability of a partial sy...
AbstractA list of positions in an n × n real matrix that includes all diagonal positions (a pattern)...
AbstractLet N={1,…,n}. Which subsets Q of N×N have the property that whenever aij for (i,j)∈Q form a...
AbstractThe symmetric M-matrix and symmetric M0-matrix completion problems are solved and results of...
AbstractThe completion problems for M-matrices and inverse M-matrices are discussed. The former has ...
Abstract The symmetric M-matrix and symmetric M0-matrix completion problems are solved and results o...
AbstractA list of positions in an n × n real matrix that includes all diagonal positions (a pattern)...
The symmetric M-matrix and symmetric M0-matrix completion problems are solved and results of Johnson...
AbstractThe symmetric M-matrix and symmetric M0-matrix completion problems are solved and results of...
An $n \times n$ matrix is called an $N$--matrix if all principal minors are negative. In this paper...
AbstractAn n×n matrix is called an N-matrix if all principal minors are negative. In this paper, we ...
AbstractLet N={1,…,n}. Which subsets Q of N×N have the property that whenever aij for (i,j)∈Q form a...
DOI
Add to ORKG