AbstractThe following theorem is proved: The Kronecker product of two fully indecom-posable matrices is fully indecomposable. The theorem is then related to connectivity in directed graphs
AbstractFor an arbitrary irreducible set of nonnegative d×d-matrices, we consider the following prob...
We show that the boundedness of the set of all products of a given pair Sigma of rational matrices i...
AbstractWe provide a set of maximal rank-deficient submatrices of a Kronecker product of two matrice...
AbstractThe following theorem is proved: The Kronecker product of two fully indecom-posable matrices...
In this paper various properties of fully indecomposable matrices are investigated. Several integer-...
In this paper various properties of fully indecomposable matrices are investigated. Several integer-...
LetA be an n-square non-negative matrix. If A contains no s\times t zero submatrix, where s + t = n,...
A square (0, 1)-matrix X of order n ≥ 1 is called fully indecomposable if there exists no integer k ...
AbstractIt is shown how a wide variety of transversal theorems can be given a common proof. The proo...
AbstractLet r, n be integers, −n < r < n. An n × n matrix A is called r-indecomposable if it contain...
AbstractLet A be a fully indecomposable n×n matrix with nonnegative integer entries. Then the perman...
AbstractWe determine the minimum permanents on certain faces of Ωn for the fully indecomposable (0, ...
AbstractA necessary and sufficient characterization of totally unimodular matrices is given which is...
AbstractFully indecomposable and essentially non-singular rectangular matrices are defined together ...
AbstractFrobenius published two proofs of a theorem which characterizes irreducible and fully indeco...
AbstractFor an arbitrary irreducible set of nonnegative d×d-matrices, we consider the following prob...
We show that the boundedness of the set of all products of a given pair Sigma of rational matrices i...
AbstractWe provide a set of maximal rank-deficient submatrices of a Kronecker product of two matrice...
AbstractThe following theorem is proved: The Kronecker product of two fully indecom-posable matrices...
In this paper various properties of fully indecomposable matrices are investigated. Several integer-...
In this paper various properties of fully indecomposable matrices are investigated. Several integer-...
LetA be an n-square non-negative matrix. If A contains no s\times t zero submatrix, where s + t = n,...
A square (0, 1)-matrix X of order n ≥ 1 is called fully indecomposable if there exists no integer k ...
AbstractIt is shown how a wide variety of transversal theorems can be given a common proof. The proo...
AbstractLet r, n be integers, −n < r < n. An n × n matrix A is called r-indecomposable if it contain...
AbstractLet A be a fully indecomposable n×n matrix with nonnegative integer entries. Then the perman...
AbstractWe determine the minimum permanents on certain faces of Ωn for the fully indecomposable (0, ...
AbstractA necessary and sufficient characterization of totally unimodular matrices is given which is...
AbstractFully indecomposable and essentially non-singular rectangular matrices are defined together ...
AbstractFrobenius published two proofs of a theorem which characterizes irreducible and fully indeco...
AbstractFor an arbitrary irreducible set of nonnegative d×d-matrices, we consider the following prob...
We show that the boundedness of the set of all products of a given pair Sigma of rational matrices i...
AbstractWe provide a set of maximal rank-deficient submatrices of a Kronecker product of two matrice...
DOI
Add to ORKG