The characterization of symmetric primitive matrices with exponent \(n-1\). (Q1870069): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The characterization of symmetric primitive matrices with exponent 2<i>n</i>−2<i>r</i>(<i>n</i>)<sup>∗</sup> / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4029099 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The exponent set of symmetric primitive (0,1) matrices with zero trace / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0024-3795(02)00543-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2001182398 / rank | |||
Normal rank |
Latest revision as of 11:30, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The characterization of symmetric primitive matrices with exponent \(n-1\). |
scientific article |
Statements
The characterization of symmetric primitive matrices with exponent \(n-1\). (English)
0 references
4 May 2003
0 references
The authors characterize completely the symmetric primitive matrices with exponent \(n-1\). An \(n\times n\) nonnegative matrix \( A=(a_{ij}) \) is said to be primitive if \(A^{k}>0\) for some positive integer \(k\), and the least such \(k\) is called the exponent of the matrix \(A\). The associated graph to an \(n\times n\)\ symmetric matrix \(A\), \(G(A)\), has \(n\) vertices and there exists an edge from \(i\) to \(j\) in \(G(A)\) if and only if \( a_{ij}>0\). A graph \(G\) is called primitive if there exists an integer \(k>0\) such that for all ordered pairs of vertices \(i,j\) of \(G\) there is a walk from \(i\) to \( j \) of length \(k\), and the least such \(k\) is called the exponent of the graph \(G.\) To prove the characterization the authors use graphs instead of matrices since a symmetric matrix \(A\) is primitive if and only if its associated graph \(G(A)\) is primitive, and moreover their exponents coincide. \textit{J. Shao} [Sci. Sin., Ser. A 30, 348--358 (1987; Zbl 0628.15017)] proved that the possible exponents for a symmetric primitive matrix are \(\{1,2,\dots ,2n-2\}-S\), where \(S\) are all odd numbers among \(\{n,n+1,\dots,2n-2\}\). In an earlier paper \textit{J. L. Cai} and \textit{K. M. Zhang} [Linear Multilinear Algebra 39, 391--396 (1995; Zbl 0843.15008)] characterize the symmetric primitive matrices with exponent \(2n-2r\) \((\geq n)\) and in this paper the authors give the first characterization with exponent less than \(n\).
0 references
primitive graph
0 references
primitive exponent
0 references
symmetric primitive matrices
0 references
0 references