The relation between the Jordan structure of a matrix and its graph (Q2365692): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q587400 |
||
| Property / reviewed by | |||
| Property / reviewed by: Kim Hang Kim / rank | |||
Revision as of 07:49, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The relation between the Jordan structure of a matrix and its graph |
scientific article |
Statements
The relation between the Jordan structure of a matrix and its graph (English)
0 references
29 June 1993
0 references
The height characteristic of a matrix \(A\) is the sequence \(n(A^ i)- n(A^{i-1})\) where \(n\) is dimension of the null space. It is proved that this strongly majorizes a sequence obtained from the graph of \(A\) by considering decompositions into paths, and which of the paths extend to cycles of length one greater. This was previously established by \textit{H. Schneider} and the author for triangular matrices [Path coverings of graphs and height characteristics of matrices. J. Combin. Theory, Ser. B (to appear)].
0 references
Jordan structure
0 references
nonclosable path
0 references
path covering
0 references
height characteristic
0 references
graph
0 references
