Convertible, nearly decomposable, and nearly reducible matrices

DOI10.1016/0024-3795(93)90368-XzbMath0773.05078OpenAlexW1973929518MaRDI QIDQ2365691

Bryan L. Shader

Publication date: 29 June 1993

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

Full work available at URL: https://doi.org/10.1016/0024-3795(93)90368-x

zbMATH Keywords

nearly decomposable matricesnearly reducible matricesconvertible matrices

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Integrally normalizable matrices and zero-nonzero patterns

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Characterization of even directed graphs
• A characterization of convertible (0,1)-matrices
• Qualitative Economics and the Scope of the Correspondence Principle

This page was built for publication: Convertible, nearly decomposable, and nearly reducible matrices