Upper bounds on scrambling index for non-primitive digraphs

DOI10.1080/03081087.2019.1663139zbMath1476.05032OpenAlexW2972385635WikidataQ127232762 ScholiaQ127232762MaRDI QIDQ5158089

A. M. Maksaev, Alexander E. 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

zbMATH Keywords

scrambling indexprimitive matrices

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

Related Items (1)

Nonnegative chainable matrices

Cites Work

• Generalized scrambling indices of a primitive digraph
• The scrambling index of primitive digraphs
• A bound on the scrambling index of a primitive matrix using Boolean rank
• The scrambling index of symmetric primitive matrices
• Primitive digraphs with the largest scrambling index
• Coefficients of ergodicity and the scrambling index
• Non-negative matrices and Markov chains. 2nd ed
• Maps preserving matrices of extremal scrambling index
• Scrambling index set of primitive digraphs
• Additive maps preserving the scrambling index are bijective
• Generalized exponents of primitive directed graphs
• Maps preserving scrambling index
• Preserving λ-scrambling Matrices*
• Double centralizing theorem with respect to q-commutativity relation
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item

This page was built for publication: Upper bounds on scrambling index for non-primitive digraphs