A unified treatment of nearly reducible and nearly decomposable matrices

DOI10.1016/0024-3795(79)90146-0zbMath0403.15008OpenAlexW2047774827MaRDI QIDQ1256021

Richard A. Brualdi, Mark Blondeau Hedrick

Publication date: 1979

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(79)90146-0

zbMATH Keywords

Nearly Reducible and Nearly Decomposable Matrices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Canonical forms, reductions, classification (15A21)

Related Items

On strong digraphs with a unique minimally strong subdigraph ⋮ Superfluous paths in strong digraphs ⋮ The scrambling index of primitive digraphs ⋮ Structural properties of minimal strong digraphs versus trees ⋮ Minimal strong digraphs ⋮ On the minimum value of the permanent of a nearly decomposable doubly stochastic matrix ⋮ Embedding nearly decomposable matrices into certain staircase matrices ⋮ Prime Boolean matrices and factorizations ⋮ \(r\)-indecomposable and \(r\)-nearly decomposable matrices ⋮ On the Exponent of a Primitive, Nearly Reducible Matrix. II ⋮ Linear Transformations on Nonnegative Matrices Preserving Properties of Irreducibility and Full Indecomposability

Cites Work

• Parallel concepts in graph theory
• A special class of irreducible matrices. The nearly reducible matrices
• The diagonal equivalence of a nonnegative matrix to a stochastic matrix
• Nearly decomposable matrices
• The DAD Theorem for Arbitrary Row Sums
• Matrices permutation equivalent to irreducible matrices and applications
• On basis diagraphs
• Problems Involving Diagonal Products in Nonnegative Matrices
• Unnamed Item