Competition indices of strongly connected digraphs
From MaRDI portal
Recommendations
- Generalized competition indices of symmetric primitive digraphs
- The generalized competition indices of primitive minimally strong digraphs
- Generalized competition index of primitive digraphs
- The m-competition indices of symmetric primitive digraphs without loops
- Generalized competition index of a primitive digraph
Cited in
(14)- Generalized competition index of an irreducible Boolean matrix
- A matrix sequence \(\{\Gamma (A^m)\}^\infty_{m=1}\) might converge even if the matrix \(A\) is not primitive
- Generalized competition index of primitive digraphs
- On \(m\)-step competition graphs of bipartite tournaments
- Scrambling index set of primitive digraphs
- On the matrix sequence \(\{\Gamma(A^m)\}_{m=1}^\infty\) for a Boolean matrix \(A\) whose digraph is linearly connected
- Competition parameters of a graph
- Generalized competition indices of symmetric primitive digraphs
- Characterization of irreducible Boolean matrices with the largest generalized competition index
- scientific article; zbMATH DE number 1409238 (Why is no real title available?)
- A bound on the generalized competition index of a primitive matrix using Boolean rank
- Matrix periods and competition periods of Boolean Toeplitz matrices
- A bound of generalized competition index of a primitive digraph
- Matrix periods and competition periods of Boolean Toeplitz matrices. II
This page was built for publication: Competition indices of strongly connected digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3008182)
