On the exponents of primitive, ministrong digraphs with shortest elementary circuit length s
From MaRDI portal
(Redirected from Publication:1894467)
On the exponents of primitive, ministrong digraphs with shortest elementary circuit length \(s\)
On the exponents of primitive, ministrong digraphs with shortest elementary circuit length \(s\)
Let \(b(s, n)= \max \gamma(D)\), where \(\gamma(D)\) is the primitive exponent of the digraph \(D\), and the maximum runs over all primitive ministrong digraphs \(D\) of order \(n\) with the shortest cycle of length \(s\). So far the value of \(b(s, n)\) has been known only for the case \(\text{gcd}(n- 1,s)= 1\). In the paper the authors determine \(b(s, n)\) in the other case, and characterize digraphs with the property \(\gamma(D)= b(s, n)\) for \(s\neq 2 ,6\).
Recommendations
Cites work
- Bounds for a Linear Diophantine Problem of Frobenius
- On a conjecture about the exponent set of primitive matrices
- On the exponent of a primitive digraph
- On the Exponent of a Primitive, Nearly Reducible Matrix
- On the Exponent of a Primitive, Nearly Reducible Matrix. II
- On the exponents of primitive digraphs with the shortest elementary circuit length s
Cited in
(4)
This page was built for publication: On the exponents of primitive, ministrong digraphs with shortest elementary circuit length \(s\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894467)
