Predecessor property, full combinatorial column rank, and the height characteristic of an \(M\)-matrix

DOI10.1016/0024-3795(93)90421-JzbMath0784.05043MaRDI QIDQ2365671

Rafael Bru, Rafael Cantó, Bit-Shun Tam

Publication date: 29 June 1993

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

zbMATH Keywords

adjacency matrixdirected graphsingular \(M\)-matricesheight characteristic numbers

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Nonnegative square roots of matrices ⋮ On nonnegative jordan chains for the generalized nullspace of a singularM-Matrix^* ⋮ Singular graph and extension of Jordan chains of an \(M\)-matrix ⋮ On the spectral properties of \(M\)-matrices and its applications

Cites Work

• Unnamed Item
• The influence of the marked reduced graph of a nonnegative matrix on the Jordan form and on related properties: a survey
• The rank of powers of matrices in a block triangular form
• On the existence of matrices with prescribed height and level characteristics
• Algebraic eigenspaces of nonnegative matrices
• On the singular graph and the Weyl characteristic of an M-matrix
• A majorization relation between the height and the level characteristics
• On the singular graph and Jordan diagram of strictly lower triangular matrices and M-matrices
• Combinatorial bases, derived jordan sets and the equality of the height and level characteristics of anM-matrix
• The singular graph of lower triangular, nilpotent matrices
• Ranks of zero patterns and sign patterns^*

This page was built for publication: Predecessor property, full combinatorial column rank, and the height characteristic of an \(M\)-matrix