Abstract
The notion of the scrambling index is a fundamental invariant in graph theory and in the theory of non-negative matrices and their applications. Namely, a scrambling index of a primitive directed graph G is the smallest positive integer such that for any pair of vertices u,v of G there exists a vertex w of G such that there are directed walks of length k from u to w and from v to w. In this paper, we generalize the definition to arbitrary directed graphs. We describe constructively the class of graphs with non-zero scrambling index and generalize the Akelbek–Kirkland bounds for the scrambling index to arbitrary directed graphs. Also, the directed graphs with extremal scrambling index are characterized.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
