On the exponent of a primitive, minimally strong digraph (Q1100474)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4043864
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the exponent of a primitive, minimally strong digraph |
scientific article; zbMATH DE number 4043864 |
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
0.9467771649360656
0 references
0.9423021674156188
0 references
0.8980851769447327
0 references
0.8926366567611694
0 references
0.8875296711921692
0 references
