On the exponent of a primitive, minimally strong digraph (Q1100474): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4101884 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4001248 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Exponent of a Primitive, Nearly Reducible Matrix / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Gaps in the exponent set of primitive matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3262596 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On exponents of primitive matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounds for exponents of doubly stochastic primitive matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Exponent of a Primitive, Nearly Reducible Matrix. II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3941473 / rank | |||
Normal rank |
Latest revision as of 16:34, 18 June 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