A Simplified Form for Nearly Reducible and Nearly Decomposable Matrices

DOI10.2307/2036368zbMath0205.04701OpenAlexW4254173389MaRDI QIDQ5604558

D. J. Hartfiel

Publication date: 1970

Full work available at URL: https://doi.org/10.2307/2036368

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

The Moore-Penrose inverse of matrices with an acyclic bipartite graph, (0,1)-matrices with minimal permanents, Structural properties of minimal strong digraphs versus trees, Minimal strong digraphs, Randomly colouring graphs (a combinatorial view), On Constructing Nearly Decomposable Matrices, Prime Boolean matrices and factorizations, Dense Sets of Diagonalizable Matrices, Convex polyhedra of doubly stochastic matrices. II: Graph of Omega sub(n), Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function, Results on Measures of Irreducibility and Full Indecomposability, A lower bound for the permanent on \(U_ n(k,k)\), Faces of Birkhoff Polytopes, Combinatorial analysis. (Matrix problems, choice theory), Ear-decompositions of matching-covered graphs, A graph theoretic upper bound on the permanent of a nonnegative integer matrix. II. The extremal case

Cites Work

• Unnamed Item
• Unnamed Item
• The diagonal equivalence of a nonnegative matrix to a stochastic matrix
• Some theorems on the permanent
• Concerning a Conjecture of Marshall Hall
• Problems Involving Diagonal Products in Nonnegative Matrices