On the exponent of a primitive, minimally strong digraph (Q1100474)

From MaRDI portal
Revision as of 16:34, 18 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    minimally strong digraph
    0 references
    primitive nearly reducible matrix
    0 references
    0 references
    0 references
    0 references
    0 references