A Simplified Form for Nearly Reducible and Nearly Decomposable Matrices
From MaRDI portal
Cites work
- Concerning a Conjecture of Marshall Hall
- scientific article; zbMATH DE number 3159208 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- Problems Involving Diagonal Products in Nonnegative Matrices
- Some theorems on the permanent
- The diagonal equivalence of a nonnegative matrix to a stochastic matrix
Cited in
(16)- Ear-decompositions of matching-covered graphs
- Convex polyhedra of doubly stochastic matrices. II: Graph of Omega sub(n)
- Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function
- (0,1)-matrices with minimal permanents
- Faces of Birkhoff Polytopes
- Structural properties of minimal strong digraphs versus trees
- Combinatorial analysis. (Matrix problems, choice theory)
- The Moore-Penrose inverse of matrices with an acyclic bipartite graph
- A lower bound for the permanent on \(U_ n(k,k)\)
- Results on Measures of Irreducibility and Full Indecomposability
- Minimal strong digraphs
- Randomly colouring graphs (a combinatorial view)
- Dense Sets of Diagonalizable Matrices
- On Constructing Nearly Decomposable Matrices
- Prime Boolean matrices and factorizations
- A graph theoretic upper bound on the permanent of a nonnegative integer matrix. II. The extremal case
This page was built for publication: A Simplified Form for Nearly Reducible and Nearly Decomposable Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5604558)
