Bounds on the generalized μ-scrambling indices of primitive digraphs
From MaRDI portal
Publication:2887019
DOI10.1080/00207160.2011.638059zbMATH Open1269.05047OpenAlexW2142593849MaRDI QIDQ2887019
Publication date: 15 May 2012
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2011.638059
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- The scrambling index of primitive digraphs
- Primitive digraphs with the largest scrambling index
- Coefficients of ergodicity and the scrambling index
- The \(m\)-step competition graph of a digraph
- COMPETITION INDICES OF TOURNAMENTS
- Generalized competition index of a primitive digraph
- Generalized scrambling indices of a primitive digraph
- The scrambling index of symmetric primitive matrices
- A bound on the scrambling index of a primitive matrix using Boolean rank
- Combinatorial Matrix Theory
Cited In (4)
This page was built for publication: Bounds on the generalized μ-scrambling indices of primitive digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2887019)