Primitive digraphs with the largest scrambling index
From MaRDI portal
Recommendations
Cites work
- Coefficients of ergodicity and the scrambling index
- Coefficients of ergodicity with respect to vector norms
- Coefficients of ergodicity: structure and applications
- Combinatorial matrix theory
- Convergence of inhomogeneous products of matrices and coefficients of ergodicity
- Non-negative matrices and Markov chains. 2nd ed
- Upper bounds on the maximum modulus of subdominant eigenvalues of nonnegative matrices
Cited in
(25)- On generalized competition index of a primitive tournament
- The scrambling index set of primitive minimally strong digraphs
- The scrambling index of primitive digraphs
- Generalized competition indices of symmetric primitive digraphs
- Generalized competition index of a primitive digraph
- Generalized scrambling indices of a primitive digraph
- Coefficients of ergodicity and the scrambling index
- The scrambling index of symmetric primitive matrices
- Upper bounds on scrambling index for non-primitive digraphs
- Load balancing for Markov chains with a specified directed graph
- An expansion property of Boolean linear maps
- The scrambling indices of primitive digraphs with exactly two cycles
- Generalized competition index of primitive digraphs
- A bound on the generalized competition index of a primitive matrix using Boolean rank
- The scrambling index of primitive two-colored two cycles whose lengths differ by 1
- A bound on the scrambling index of a primitive matrix using Boolean rank
- The generalized competition indices of primitive minimally strong digraphs
- Scrambling index set of primitive digraphs
- Bounds on the generalized -scrambling indices of primitive digraphs
- Uniform scrambles on graphs
- The scrambling index of a primitive digraph \(D_{n,q,s}\)
- Maps preserving two small values of -th upper scrambling index
- Some bounds of the generalized \(\mu \)-scrambling indices of primitive digraphs with \(d\) loops
- Lower scrambling indices of primitive minimally strong digraphs
- A bound of generalized competition index of a primitive digraph
This page was built for publication: Primitive digraphs with the largest scrambling index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q999792)