The exponent and circumdiameter of primitive digraphs
The exponent of a primitive digraph \(D\) is the smallest \(m\) such that for each ordered pair \((u,v)\) of not necessarily distinct vertices, there exists a \(u\)-\(v\) walk of length \(m\). The circumdiameter of \(D\) is the maximum over all ordered pairs \((u,v)\) of not necessarily distinct vertices of the length of a shortest \(u\)-\(v\) walk that intersects cycles of all lengths. It is known that the exponent of \(D\) is less than or equal to the sum of its Frobenius-Schur index and the circumdiameter. The paper gives several new sufficient conditions and families of digraphs for which equality holds in the above upper bound. Additional sufficient conditions for equality in the above upper bound for the exponent of \(D\) and a new upper bound for the circumdiameter are given for digraphs with large exponent. The paper also presents circumdiameter and bounds on the exponent for the digraph of a Leslie matrix.
- A bound on the exponent of primitivity in terms of diameter
- A diameter bound on the exponent of a primitive directed graph
- 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
- Ergodic properties of populations. I: The one sex model
- Gaps in the exponent set of primitive matrices
- On the exponent of a primitive digraph
- On the Exponent of a Primitive, Nearly Reducible Matrix. II
- On the linear diophantine problem of Frobenius.
- The Structure of Powers of Nonnegative Matrices I. The Index of Convergence
- Unzerlegbare, nicht negative Matrizen
- Wielandt's proof of the exponent inequality for primitive nonnegative matrices
This page was built for publication: The exponent and circumdiameter of primitive digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1763834)
