Predecessor property, full combinatorial column rank, and the height characteristic of an \(M\)-matrix (Q2365671)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Predecessor property, full combinatorial column rank, and the height characteristic of an M-matrix |
scientific article; zbMATH DE number 222578
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Predecessor property, full combinatorial column rank, and the height characteristic of an \(M\)-matrix |
scientific article; zbMATH DE number 222578 |
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
0 references
0.7725777626037598
0 references
0.7648413777351379
0 references
0.7569100260734558
0 references
0.7568277716636658
0 references
