Upper bounds on scrambling index for non-primitive digraphs
DOI10.1080/03081087.2019.1663139zbMATH Open1476.05032OpenAlexW2972385635WikidataQ127232762 ScholiaQ127232762MaRDI QIDQ5158089
A. M. Maksaev, Alexander Guterman
Publication date: 21 October 2021
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2019.1663139
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Extremal problems in graph theory (05C35) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- Combinatorial matrix theory
- Depth-First Search and Linear Graph Algorithms
- Non-negative matrices and Markov chains. 2nd ed
- Scrambling index set of primitive digraphs
- The scrambling index of primitive digraphs
- Primitive digraphs with the largest scrambling index
- Coefficients of ergodicity and the scrambling index
- Generalized scrambling indices of a primitive digraph
- The scrambling index of symmetric primitive matrices
- Generalized exponents of primitive directed graphs
- A bound on the scrambling index of a primitive matrix using Boolean rank
- Double centralizing theorem with respect to q-commutativity relation
- Maps preserving matrices of extremal scrambling index
- Additive maps preserving the scrambling index are bijective
- Maps preserving scrambling index
- Preserving λ-scrambling Matrices*
Cited In (4)
This page was built for publication: Upper bounds on scrambling index for non-primitive digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5158089)
