\(r\)-indecomposable and \(r\)-nearly decomposable matrices (Q2568388): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Lihua You / rank | |||
Property / author | |||
Property / author: Bo Lian Liu / rank | |||
Property / reviewed by | |||
Property / reviewed by: Rabe-Rüdiger von Randow / rank | |||
Property / author | |||
Property / author: Lihua You / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Bo Lian Liu / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Rabe-Rüdiger von Randow / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.laa.2005.04.031 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2038242018 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A unified treatment of nearly reducible and nearly decomposable matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quelques problèmes de connexite dans les graphes orientes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Exponents of vertex-transitive digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On circulant Boolean matrices / rank | |||
Normal rank |
Latest revision as of 17:20, 10 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | \(r\)-indecomposable and \(r\)-nearly decomposable matrices |
scientific article |
Statements
\(r\)-indecomposable and \(r\)-nearly decomposable matrices (English)
0 references
10 October 2005
0 references
Let \(n\), \(r\) be nonnegative integers with \(r< n\). An \(n\times n\) matrix \(A\) is called \(r\)-partly de(composable) if it contains a \(k\times l\) zero submatrix with \(k+ l= n -r+ 1\). If \(A\) is not \(r\)-partly dec, it is called \(r\)-indec (a \(0\)-indec matrix is call a Hall matrix). If \(A\) is \(r\)-indec but, for every non-zero element of \(A\), the matrix \(A\) with that element replaced by \(0\) is \(r\)-partly dec, then \(A\) is called \(r\)-nearly dec. In this paper the authors derive numerical and enumerative results on \(r\)-nearly dec 0-1 matrices as well as bounds on the convergence index of \(r\)-indec matrices, in particular for the adjacency matrices of primitive Cayley digraphs and circulant matrices.
0 references
partly decomposable matrix
0 references
indecomposable matrix
0 references
nearly decomposable matrix
0 references
primitive matrix
0 references
exponent
0 references
Cayley digraph
0 references
Hall matrix
0 references
convergence index
0 references
circulant matrices
0 references