Primitive digraphs with smallest large exponent
From MaRDI portal
Publication:2477548
The paper shows that the minimum number of arcs in a primitive digraph on \(n > 4\) vertices with large exponent is either \(n + 1\) or \(n + 2\). A necessary and sufficient condition is given for the existence of a primitive digraph on \(n\) vertices with large exponent and \(n + \)1 arcs, thereby giving an algorithm that determines for fixed n whether the minimum number of arcs is \(n + 1\) or \(n + 2\).
Recommendations
Cites work
- A note on the eigenvalues of a primitive matrix with large exponent
- A system of gaps in the exponent set of primitive matrices
- Combinatorial matrix theory
- Digraphs with large exponent
- Gaps in the exponent set of primitive matrices
- scientific article; zbMATH DE number 3523640 (Why is no real title available?)
- Matrix Analysis
- Primitive digraphs with smallest large exponent
- The exponent and circumdiameter of primitive digraphs
- The Lattice Point Covering Theorem for Rectangles
- Unzerlegbare, nicht negative Matrizen
Cited in
(8)- On the number of arcs in primitive digraphs with large exponents
- Integer solutions to \(x^2+ y^2= z^2-k\) for a fixed integer value \(k\)
- Primitive digraphs with smallest large exponent
- scientific article; zbMATH DE number 123779 (Why is no real title available?)
- scientific article; zbMATH DE number 1735796 (Why is no real title available?)
- Digraphs with large exponent
- Structural properties of minimal primitive digraphs
- Primitive graphs with given exponents and minimum number of edges
This page was built for publication: Primitive digraphs with smallest large exponent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2477548)