A bound on the generalized competition index of a primitive matrix using Boolean rank
From MaRDI portal
Publication:551345
DOI10.1016/j.laa.2011.04.002zbMath1221.05236OpenAlexW2128255188MaRDI QIDQ551345
Publication date: 15 July 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2011.04.002
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48) Directed graphs (digraphs), tournaments (05C20)
Related Items (6)
Generalized competition index of an irreducible Boolean matrix ⋮ The generalized competition indices of primitive minimally strong digraphs ⋮ Scrambling index set of primitive digraphs ⋮ Characterization of irreducible Boolean matrices with the largest generalized competition index ⋮ The primitive matrices of sandwich semigroups of generalized circulant Boolean matrices ⋮ Generalized competition index of primitive digraphs
Cites Work
- Unnamed Item
- A bound on the scrambling index of a primitive matrix using Boolean rank
- Generalized competition index of a primitive digraph
- Primitive digraphs with the largest scrambling index
- Coefficients of ergodicity and the scrambling index
- On generalized exponents of tournaments
- A bound on the exponent of a primitive matrix using Boolean rank
- Unzerlegbare, nicht negative Matrizen
- COMPETITION INDICES OF STRONGLY CONNECTED DIGRAPHS
- COMPETITION INDICES OF TOURNAMENTS
This page was built for publication: A bound on the generalized competition index of a primitive matrix using Boolean rank