On the exponent of a primitive, minimally strong digraph (Q1100474): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(88)90131-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2007296129 / rank | |||
Normal rank | |||
Revision as of 03:49, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the exponent of a primitive, minimally strong digraph |
scientific article |
Statements
On the exponent of a primitive, minimally strong digraph (English)
0 references
1988
0 references
Let e(n), \(n\geq 5\), be the least integer \(\geq 6\) such that no \(n\times n\) primitive nearly reducible matrix has this integer as its exponent. In the paper the various lower bounds for e(n) are presented. In addition, the values e(6), e(7), e(8) are determined.
0 references
minimally strong digraph
0 references
primitive nearly reducible matrix
0 references
