Some bounds of the generalized \(\mu \)-scrambling indices of primitive digraphs with \(d\) loops
From MaRDI portal
Publication:2072915
DOI10.1186/s13660-021-02667-yzbMath1504.05115OpenAlexW3184353992MaRDI QIDQ2072915
Feng Liu, Ling Zhang, Zhongshan Li, Gu-Fang Mou
Publication date: 26 January 2022
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-021-02667-y
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)
Cites Work
- Generalized scrambling indices of a primitive digraph
- A bound on the scrambling index of a primitive matrix using Boolean rank
- Generalized competition index of a primitive digraph
- The scrambling index of symmetric primitive matrices
- Primitive digraphs with the largest scrambling index
- Coefficients of ergodicity and the scrambling index
- The \(m\)-step competition graph of a digraph
- Bounds on the generalized μ-scrambling indices of primitive digraphs
- COMPETITION INDICES OF TOURNAMENTS
- On fully indecomposable exponent for primitive boolean matrices with symmetric ones
- Combinatorial Matrix Theory
This page was built for publication: Some bounds of the generalized \(\mu \)-scrambling indices of primitive digraphs with \(d\) loops