Predecessor property, full combinatorial column rank, and the height characteristic of an \(M\)-matrix (Q2365671): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: Bit-Shun Tam / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Christoph Schulz / rank | |||
Revision as of 21:12, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Predecessor property, full combinatorial column rank, and the height characteristic of an \(M\)-matrix |
scientific article |
Statements
Predecessor property, full combinatorial column rank, and the height characteristic of an \(M\)-matrix (English)
0 references
29 June 1993
0 references
The authors prove relations between the predecessor property of the level subsets of a loopless, acyclic, transitive directed graph and the property of certain blocks of its adjacency matrix having full combinatorial rank. This also yields new lower bounds for the height characteristic numbers of singular \(M\)-matrices with a prescribed singular graph.
0 references
directed graph
0 references
adjacency matrix
0 references
height characteristic numbers
0 references
singular \(M\)-matrices
0 references
